Publications of the Department of Discrete Mathematics workers since 2001
No.AuthorsTitleJournalJournal no.YearPages
1.S. Cichacz, D. Fronček, M. MeszkaDecomposition of complete graphs into small generalized prismsAKCE INT. J. GRAPHS COMB. 10(3)2013285-293
2.B. Trzaskuś-Żak, A. ŻakBinary Linear Programming in the Management of Mine ReceivablesARCHIVES OF MINING SCIENCES582013941-952
3.J. PrzybyłoOn upper bounds for multiple domination numbers of graphsDISCRETE APPLIED MATHEMATICS161(16-17)20132758-2763
4.Ł. Kowalik, M. Pilipczuk, K. SuchanTowards optimal kernel for connected vertex cover in planar graphsDISCRETE APPLIED MATHEMATICS16120131154-1161
5.S.Cichacz, A.Görlich, Z. TuzaCordial labeling of hypertrees DISCRETE MATHEMATICS3132013
6.C.C. Lindner, M. Meszka, A. RosaTriple metamorphosis of twofold triple systemsDISCRETE MATHEMATICS31320131872-1883
7.J. PrzybyłoDistant irregularity strength of graphsDISCRETE MATHEMATICS313(24)20132875-2880
8.S. Gosselin, A. Szymański, A.P. WojdaCyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphsDISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE15(2)2013215-222
9.A. Kemnitz, J.Przybyło, I. Schiermeyer, M. WoźniakRainbow Connection in Sparse GraphsDISCUSSIONES MATHEMATICAE GRAPH THEORY 33(1)2013181-192
10.J.L. Fouquet, H. Thuillier, J.M. Vanherpe, A.P. WojdaOn minimum (K_q,k) stable graphsDISCUSSIONES MATHEMATICAE GRAPH THEORY 33(1)2013101-115
11.J. Otfinowska, M. WoźniakA note on uniquely embeddable forestsDISCUSSIONES MATHEMATICAE GRAPH THEORY 33(1)2013193-201
12.A. Kemnitz, J.Przybyło, I. Schiermeyer, M. WoźniakRainbow Connection in Sparse GraphsDISCUSSIONES MATHEMATICAE GRAPH THEORY 33(1)2013181-192
13.R. Kalinowski, M. Pilśniak, J. Przybyło, M. WoźniakCan colour-blind distinguish colour palletes?ELECTRONIC JOURNAL OF COMBINATORICS20(3)2013#P23
14.A. Rucinski, A. ŻakHamilton Saturated Hypergraphs of Essentially Minimum SizeELECTRONIC JOURNAL OF COMBINATORICS202013#P25
15.A. ŻakNear Packings of GraphsELECTRONIC JOURNAL OF COMBINATORICS202013#P36
16.S. Cichacz, D. Froncek, P. KovarDecomposition of complete bipartite graphs into generalized prismsEUROPEAN JOURNAL OF COMBINATORICS342013104-110
17.A. ŻakGrowth order for the size of smallest hamiltonian chain saturated uniform hypergraphsEUROPEAN JOURNAL OF COMBINATORICS342013724-735
18.E. Flandrin, A. Marczyk, J. Przybyło, J. Saclé, M. WoźniakNeighbor sum distinguishing indexGRAPHS AND COMBINATORICS29(5)20131329-1336
19.E.J. Billington, C.C. Lindner, M. Meszka, A. RosaExtra 2-perfect twofold 6-cycle systemsQUADERNI DI MATEMATICA282013135-150
20.J. PrzybyłoNeighbor distinguishing edge colorings via the Combinatorial NullstellensatzSIAM JOURNAL ON DISCRETE MATHEMATICS 27(3)20131313-1322
21.S.CichaczGroup distance magic labeling of some cycle-related graphs THE AUSTRALASIAN JOURNAL OF COMBINATORICS572013
22.C.C. Lindner, M. Meszka, A. RosaPalettes in block colourings of designsTHE AUSTRALASIAN JOURNAL OF COMBINATORICS562013235-243
23.M.NikodemFalse alarms in fault-tolerant dominating sets in graphsOPUSCULA MATHEMATICA32(4)2012751-760
24.J.-L. Fouquet, H. Thuillier, J.-M. Vanhere i A.P. WojdaOn (Kq,k) vertex stable graphs with minimum sizeDISCRETE MATHEMATICS31220122109-2118
25.R.Kalinowski, M.Pilśniak, M.WoźniakPrefaceDISCRETE MATHEMATICS31220122091
26.L. Płachta, J. Przybyło i M. WoźniakSeifert graphs and the braid index of classical and singular linksDISCRETE MATHEMATICS31220122819-2831
27.M.Hornak, M.WoźniakOn neighbour-distinguishing colourings from listsDISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE14 (2)201221-28
28.M.Hornak, A. Marczyk, I. Schiermeyer, M.WoźniakDense Ar- bitrarily Vertex Decomposable GraphsGRAPHS AND COMBINATORICS282012807--821
29.O. Baudon, J. Przybyło i M. WoźniakOn minimal arbitrarily partitionable graphsINFORMATIONS PROCESSING LETTERS1122012697-700
30.A. Görlich, A. ŻakSparse graphs of girth at least five are packableDISCRETE MATHEMATICS31220123606-3613
31.S. Cichacz, A. Görlich, M. Nikodem, A. ŻakA lower bound on the size of (H; 1)-vertex stable graphsDISCRETE MATHEMATICS31220123026-3029
32.A. Dudek, A. ŻakOn Hamilton-chain saturated uniform hypergraphsDISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE14201221-28
33.M. Borowiecki, J. Grytczuk, M.PilśniakColoring chip configurations on graphs and digraphsINFORMATIONS PROCESSING LETTERS11220121--4
34.S.Cichacz, A.Görlich, M. Zwonek, A. ŻakOn (Cn; k) stable graphsELECTRONIC JOURNAL OF COMBINATORICS18 (1)2011# 205
35.S. Cichacz, A. GörlichOpen trails in digraphsOPUSCULA MATHEMATICA31/42011599-604
36.J. Grytczuk, J. Przybyło, Xuding ZhuThue Choice Number of PathsRANDOM STRUCTURES & ALGORITHMS38(1-2)2011162-173
37.S. Cichacz, J. PrzybyloIrregular edge coloring of 2-regular graphsDISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE13(1)20111--12
38.A. Dudek, A. ŻakOn vertex stability with regard to complete bipartite subgraphsDISCUSSIONES MATHEMATICAE GRAPH THEORY302010663-669
39.H.Li, M. WoźniakA note on graphs containing all trees of a given sizeARS COMBINATORIA942010
40.S. Cichacz, D. FroncekBipartite graphs decomposable into closed trailsJ. COMBIN. MATH. COMBIN. COMPUT.742010207-216
41.A. Szymański i A.P. WojdaCyclic partitions of complete uniform hypergraphsELECTRONIC JOURNAL OF COMBINATORICS1720101
42.A. Görlich, A. ŻakA note on perfect dissections of an equilateral triangleSIAM JOURNAL ON DISCRETE MATHEMATICS242010552-557
43.T. Juszczyk, I.A.ZiołoOn some families of arbitrarily vertex decomposable spidersOPUSCULA MATHEMATICA30(2)2010147-154
44.J. Przybyło, M. WoźniakOn a 1,2 ConjectureDISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE12 (1)2010101-108
45.S. Cichacz,A.GörlichEdge-disjoint open trails in complete bipartite multigraphsGRAPHS AND COMBINATORICS262010207-214
46.S. Cichacz, J. PrzybyłoVertex-distinguishing edge-colorings of linear forestsDISCUSSIONES MATHEMATICAE GRAPH THEORY30201095-103
47.S. Cichacz,2-splittable and cordial graphs, Opuscula MathematicaOPUSCULA MATHEMATICA30(1)201061-67
48.A. ŻakDISSECTIONS OF POLYGONS INTO CONVEX POLYGONSInternational Journal Of Computational Geometry And Applications (IJCGA)202010223-244
49.A.Dudek, A. Żak, G. Y. KatonaHamilton-chain saturated hypergraphsDISCRETE MATHEMATICS31020101172-1176
50.A.P.WojdaPrefaceDISCUSSIONES MATHEMATICAE GRAPH THEORYVol. 152010275-276
51.F. V. Fomin, P. Golovach, J. Kratochvíl, N. Nisse, K. SuchanPursuing a fast robber on a graphTHEORETICAL COMPUTER SCIENCE41120101167-1181
52.N. Nisse, I. Rapaport, K. SuchanDistributed computing of efficient routing schemes in generalized chordal graphsLECTURE NOTES IN COMPUTER SCIENCE58692010252-265
53.A. Görlich, M.PilśniakA note on an embedding problem in transitive tournaments DISCRETE MATHEMATICS3102010681-686
54.I. Rapaport, K. Suchan, I. Todinca, J. VerstraëteOn Dissemination Thresholds in Regular and Irregular Graph ClassesALGORITHMICAdx.doi.org/10.1007/s00453-009-9309-02010
55.L.PlachtaS-graphs and braid index of linksMat. Metody Fiz.-Mekh. Polya52(2)20095--16
56.L. Adamus, B. Orchel, A. Szymański, A.P. Wojda, M. ZwonekA note on t-complementing permutations for graphsINFORMATION PROCESSING LETTERS110200944-45
57.C.C. Lindner, M. Meszka, A. RosaAlmost resolvable cycle systems-an analogue of Hanani triple systemsJOURNAL OF COMBINATORIAL DESIGNS172009404-410
58.K. Suchan, Y. VillangerComputing pathwidth faster than 2^nLECTURE NOTES IN COMPUTER SCIENCE59172009324-335
59.J. PrzybyłoLinear bound on the irregularity strength and the total vertex irregularity strength of graphsSIAM JOURNAL ON DISCRETE MATHEMATICS23 (1)2009511-516
60.M. Anholcer, M. Kalkowski, J. PrzybyłoA new upper bound for the total vertex irregularity strength of graphsDISCRETE MATHEMATICS309 (21)20096316-6317
61.M. Meszkak-cycle free one-factorizations of complete graphsELECTRONIC JOURNAL OF COMBINATORICS162009R3, 14pp
62.M.Meszka, Z. SkupieńDecompositions of nearly complete digraphs into t partsDISCUSSIONES MATHEMATICAE GRAPH THEORY292009563-572
63.K. Nikodem, M. NikodemRemarks on t-quasiconvex functionsMATHEMATICAL INEQUALITIES & APPLICATIONSVol 12, No 42009711-717
64.M. Meszka, A. RosaDecomposing complete 3-uniform hypergraph into Hamiltonian cyclesTHE AUSTRALASIAN JOURNAL OF COMBINATORICS452009291-302
65.C.C. Lindner, M. Meszka, C. PettisThe inside outside intersection problem for hexagon triple systemsMath. Slovaca592009137-154
66. M.Zwonek, A.Dudek$(H,k)$ stable bipartite graph with minimum size DICCUSSIONES MATHEMATICAE GRAPH THEORY292009199-202
67.S. Cichacz, Y. Egawa, M. Wozniak,Arbitrary decompositions into open and closed trailsDISCRETE MATHEMATICS30920091511-1516
68.J.-L. Fouquet, H. Thuillier, J.-M. Vanherpe i A.P. WojdaOn odd and semiodd linear partitions of cubic graphsDICCUSSIONES MATHEMATICAE GRAPH THEORY292009275-292
69.A. ŻakA note on perfect dissections of an equilateral triangleTHE AUSTRALASIAN. JOURNAL OF COMBINATORICS44200987-93
70.A. ŻakHarmonious order of graphsDISCRETE MATHEMATICS30920096055-6064
71.A. Szymański i A.P. WojdaA note on $k$-uniform self-complementary hypergraphs of given orderDICCUSSIONES MATHEMATICAE GRAPH THEORY292009199-202
72.K. Suchan, I. TodincaMinimal interval completion through graph explorationTHEORETICAL COMPUTER SCIENCE410(1)200935-43
73.A.P. WojdaExtremal traceable graphs with non-traceable edgesOPUSCULA MATHEMATICA29200989-92
74.A. Szymański i A.P. WojdaSelf-complementing permutations of $k$-uniform hypergraphsDISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE112009117-124
75.J.-L. Fouquet, H. Thuillier, J.-M. Vanherpe i A.P. WojdaOn isomorphic linear partitions in cubic graphsDISCRETE MATHEMATICS30920096425-6433
76.S. Cichacz, D. FroncekFactorization of Kn,n into (0,j)-prismsINFORMATION PROCESSING LETTERS1092009932-934
77.S. Cichacz, J. Przybylo, M. WozniakDecompositions of pseudographs into closed trails of even sizesDISCRETE MATHEMATICS30920094903-4908
78.A. Fortuna, Z. Skupień, A. ŻakMaximizing hamiltonian pairs and k-sets via numerous leaves in a treeDISCRETE MATHEMATICS30920091788-1792
79.A.Dudek M.Zwonek(H,k) stable bipartite graphs with the minimum sizeDICCUSSIONES MATHEMATICAE GRAPH THEORY292009513-581
80.S. Cichacz, D. Froncek, P. KovarNote on decomposition of Kn,n into (0,j)-prismsLECTURE NOTES IN COMPUTER SCIENCE58742009125-133
81.L. AdamusEdge condition for long cycles in bipartite graphsDISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE11 (2)200925-32
82.J. Adamus, L. AdamusOre and Erdos type conditions for long cycles in balanced bipartite graphsDISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE11 (2)200957-70
83.S. Cichacz, Y. Egawa, M. Wozniak,Arbitrary decompositions into open and closed trailsDISCRETE MATHEMATICS30920091511-1516
84.S. Cichacz, M. Hornak,Decomposition of bipartite graphs into closed trailsCZECHOSLOVAK MATHEMATICAL JOURNAL59(1)2009129-144
85.S. Cichacz, D. Froncek, A. Khodkar, W. XuSuper edge-graceful paths and cycles,BULLETIN OF ICA57200979--90
86.A. MarczykAn Ore-type condition for arbitrarily vertex decomposable graphsDISCRETE MATHEMATICS30920093588-3594
87.R.Kalinowski, M.Pilśniak, M.Woźniak, I.ZiołoArbitrarily vertex decomposable suns with few raysDISCRETE MATHEMATICS3092009
88.R.Kalinowski, M.Pilśniak, M.Woźniak, I.ZiołoOn-line arbitrarily vertex decomposable sunsDISCRETE MATHEMATICS3092009 6328_6336
89.M.Meszka, A. Rosa, I. ZiołoSteiner almost self-complementary graphs and halving nearly Steiner Triple SystemsDISCRETE MATHEMATICS309 (18)20095650-5654
90.M.MeszkaPrefaceDISCRETE MATHEMATICS309 (22)20096327
91.A. GörlichPlanar packing of cycles and unicyclic graphsDEMONSTRATIO MATHEMATICA4(42)2009673-679
92.Denise Amar, Evelyne Flandrin, Grzegorz GancarzewiczCyclability in bipartite graphsOPUSCULA MATHEMATICA292009345 - 364
93.Denise Amar, Evelyne Flandrin, Grzegorz GancarzewiczA degree condition implying that every matching is contained in a hamiltonian cycleDISCRETE MATHEMATICS30920093703 - 3713
94.C.C. Lindner, M.Meszka, A. RosaOn (K_4,K_4-e)-designsARS COMBINATORIA932009333-340
95.A.Görlich, A. ŻakA Note on Packing Graphs Without Cycles of Length up to Five ELECTRONIC JOURNAL OF COMBINATORICS16(1)200940177
96.S. van Aardt, F. Bullock, J. Górska, Z. Skupień On detour homogeneous digraphsDISCRETE MATHEMATICS30920096415-6424
97.I. Rapaport, K. Suchan, I. Todinca, J. VerstraeteOn Dissemination Thresholds in Regular and Irregular Graph ClassesLECTURE NOTES IN COMPUTER SCIENCE4957200824-35
98.I. Rapaport, K. Suchan, I. TodincaMinimal proper interval completionsINFORMATION PROCESSING LETTERS106 (5)2008195-202
99.J. PrzybyłoIrregularity strength of regular graphsELECTRONIC JOURNAL OF COMBINATORICS15 (1)2008#R82
100.J. PrzybyłoA note on neighbour-distinguishing regular graphs total-weightingELECTRONIC JOURNAL OF COMBINATORICS15 (1)2008#N35
101.Z. Skupień, A. ŻakRainbow regular order of graphsTHE AUSTRALASIAN. JOURNAL OF COMBINATORICS422008115-127
102. D. Bród, Z. SkupieńRecurrence among trees with most numerous efficient dominating setsDISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE102008 43-56
103.E.Gyori, M.Hornak, C.Palmer, M.WoźniakGeneral neighbour distinguishing index of a graphDISCRETE MATHEMATICS308 (5-6)2008827-831
104.A. MarczykCycles in graphs and related problemsDISSERTATIONES MATHEMATICAE 45420081-98
105.A. Dudek, A. Szymański, M. Zwonek(H,k) stable graphs with minimum sizeDISCUSSIONES MATHEMATICAE GRAPH THEORY282008137-149
106.S. Cichacz, J. Przybylo, M. WozniakIrregular edge-colorings of sums of cycles of even lengthsAuststralas. J. Combinatorics 40200841-56
107.L. Adamus, E. Leśniak, B. Orchel3-biplacement of bipartite graphsOPUSCULA MATHEMATICA282008535-549
108.M.Hornak, M.WoźniakOn arbitrarily vertex decomposable treesDISCRETE MATHEMATICS308 (7)20081268-1281
109.B. Orchel, A. P WojdaIndependent cycles and paths in bipartite balanced graphsDISCUSSIONES MATHEMATICAE GRAPH THEORY282008535-549
110.M. Meszka, R. Nedela, A. RosaThe chromatic number of 5-valent circulants DISCRETE MATHEMATICS30820086269-6284
111.M. MeszkaSolution to the problem of KubesaDISCUSSIONES MATHEMATICAE GRAPH THEORY282008375-378
112.K. Suchan,I. TodincaPathwidth of circular-arc graphsLECTURE NOTES IN COMPUTER SCIENCE47692007258-269
113.P. Heggernes, K. Suchan, I. Todinca, Y. VillangerCharacterizing Minimal Interval Completions LECTURE NOTES IN COMPUTER SCIENCE43932007236-247
114.K. Suchan, I. TodincaOn powers of graphs of bounded NLC-width (clique-width)DISCRETE APPLIED MATHEMATICS155 (14)20071885-1893
115.L.PlachtaLink diagrams and S-graphsMat. Metody Fiz.-Mekh. Polya50(2)200716 Jul
116.L.PlachtaGenera, band sums of knots and invariants of finite orderTOPOLOGY AND ITS APPLICATIONS15420072880-2887
117.L.PlachtaKnots, surfaces and Vassiliev invariants59(2)20071239-1252
118.G.Schaar, Z.SkupieńPairs of trees in tree-tree triangulationsDISCRETE MATHEMATICS30720071499-1505
119.Z.SkupieńBCH codes and distance multi- or fractional colorings in hypercubes asymptotically,DISCRETE MATHEMATICS3072007990-1000
120.Z.Dziechcińska-Halamoda, Z.Majcher, J.Michael, Z.SkupieńA Sokobantype game and arc deletion within irregular digraphs of all sizesDISCUSSIONES MATHEMATICAE GRAPH THEORY272007611-622
121.A.P.Wojda, M.Woźniak, I.A.ZiołoOn self-complementary cyclic packing of forestsELECTRONIC JOURNAL OF COMBINATORICS142007#R62
122.M. Hornak, Zs.Tuza, M.WoźniakOn-line arbitrarily vertex decomposable treesDISCRETE APPLIED MATHEMATICS155 (11)20071420-1429
123.I.Schiermeyer, M.WoźniakNew suffcient conditions for hamiltonian and pancyclic graphsDISCUSSIONES MATHEMATICAE GRAPH THEORY27 (1)200729-38
124.S. CichaczDecomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trailsDISCUSSIONES MATHEMATICAE GRAPH THEORY27 (2)2007241-249
125.A. Görlich, M. Pilśniak, M. Woźniak, I. ZiołoFixed-point-free embeddings of digraphs with small sizeDISCRETE MATHEMATICS30720071332-1340
126.A. Görlich, R. Kalinowski, M. Meszka, M. Pilśniak, M. WoźniakA note on decompositions of transitive tournaments IITHE AUSTRALASIAN. JOURNAL OF COMBINATORICS37200757-66
127.J.Górska, Z.SkupieńTrees with maximum number of maximal matchingsDISCRETE MATHEMATICS30720071367-1377
128.W. Frydrych, A. ŻakPreface to preceedings 14th Workshop '3in1' GRAPHS 2005 DobczyceDISCUSSIONES MATHEMATICAE GRAPH THEORY272007559
129.D. Amar, E. Flandrin, G. Gancarzewicz, A. P. WojdaBipartite graphs with every matching in a cycleDISCRETE MATHEMATICS30720071525-1537
130.A.Goerlich, R.Kalinowski, M.Meszka, M.Pilśniak, M.WoźniakA note on decompositions of transitive tournamentsDISCRETE MATHEMATICS307 (7-8)2007896-904
131.M.Pilśniak, M.WoźniakA note on packing of two copies of a hypergraphDISCUSSIONES MATHEMATICAE GRAPH THEORY27 (1)200745-49
132.M. Meszka, A. RosaCyclic Kirkman triple systemsCongr. Numer. 1882007129-136
133.E.Flandrin, H.Li, A.Marczyk, M.WoźniakA Chvatal-Erdos type condition for pancyclabilityDISCRETE MATHEMATICS307 (11-12)20071463-1466
134.M.PilśniakPacking of two digraphs into the transitive tournamentDISCRETE MATHEMATICS307 (7-8)2007971-974
135.I.J. Dejter, C.C. Lindner, C.A. Rodger, M. MeszkaAlmost resolvable 4-cycle systems J. Combin. Math. Combin. Comput.632007 173-181
136.R.Kalinowski, M.MeszkaPrefaceDISCRETE MATHEMATICS30720071221-1222
137.E.Flandrin, H.Li, A.Marczyk, M.WoźniakA generalisation of Dirac's theorem on cycles through k vertices in k-connected graphsDISCRETE MATHEMATICS307 (7-8)2007878-884
138.M.ZwonekOn arc-coloring of digraphsOPUSCULA MATHEMATICA26(1)2006185-195
139.M.ZwonekA note on total colourings of digraphsDISCRETE MATHEMATICS30620062282-2291
140.K.Edwards, M.Hornak, M.WoźniakOn the neighbour-distinguishing index of a graphGRAPHS AND COMBINATORICS222006341-350
141.I. Rapaport,K. Suchan,I. TodincaMinimal Proper Interval CompletionsLECTURE NOTES IN COMPUTER SCIENCE42712006217-228
142.K. Suchan,I. TodincaMinimal interval completion through graph explorationLECTURE NOTES IN COMPUTER SCIENCE42882006517-526
143.AP WojdaSelf-complementary hypergraphsDISCUSSIONES MATHEMATICAE GRAPH THEORY262006217-224
144.S. Cichacz, A. Görlich, A. Marczyk, J. Przybyło M.WoźniakArbitrarily vertex decomposable caterpillars with four or five leavesDISCUSSIONES MATHEMATICAE GRAPH THEORY26 (2)2006291-305
145.Z.Dziechcińnska-Halamoda, Z.Majcher, J.Michael, Z.SkupieńExtremum degree sets of irregular oriented graphs and pseudodigraphsDISCUSSIONES MATHEMATICAE GRAPH THEORY262006317-333
146.D.Bród, Z.SkupieńTrees with extremal numbers of dominating setsTHE AUSTRALASIAN. JOURNAL OF COMBINATORICS352006273-290
147.S.Cichacz, T.Sulima-Samujłło, T.WiejaComputer Aided Visualisation of Problems Related to PolyhedraPorceedings of symposium on Computer geometry, Kočovce15200624-27
148.S.Cichacz, I.A.ZiołoOn arBIT NUMERICAL MATHEMATICSrarily vertex decomposable unicyclic graphs with dominating cycleDISCUSSIONES MATHEMATICAE GRAPH THEORY26 (3)2006403-412
149.A. MarczykA note on arBIT NUMERICAL MATHEMATICSrarily vertex decomposable graphsOPUSCULA MATHEMATICA262006109-118
150.M. Meszka, D. FrončekThe Cheesecake Factory problemCongr. Numer. 18220065-10
151.M. Meszka, Z. SkupieńLong paths decompositions of a complete digraph of odd orderCongr. Numer. 1832006203-211
152.M.Meszka, Z.SkupieńDecompositions of a complete multidigraph into nonhamiltonian pathsJOURNAL OF GRAPH THEORY 51200682-91
153.A. Dudek, G. Katona i AP WojdaHamiltonian path saturated graphs with small sizeDISCRETE APPLIED MATHEMATICS15420061372-1379
154.W.Frydrych, A. ŻakPreface to preceedings 13th Workshop '3in1' GRAPHS 2004 KrynicaDISCUSSIONES MATHEMATICAE GRAPH THEORY262006279
155.A.Görlich, M.Pilśniak, M.WoźniakA note on a packing problem in transitive tournamentsGRAPHS AND COMBINATORICS222006233-239
156.E. Flandrin, H. Li, A. Marczyk, I. Schiermeyer, M. WoźniakChvatal-Erdos condition and pancyclismDISCUSSIONES MATHEMATICAE GRAPH THEORY262006335-342
157.L.PlachtaKnots, satellite operarions and invariants of finite orderJ. Knot Theory Ramifications1520061061-1077
158.L.PlachtaEssential tori admitting standard tilingFUNDAMENTA MATHEMATICAE1892006195-206
159.B. OrchelBipartite embedding of (p,q)-treesOPUSCULA MATHEMATICA262006117-123
160.M. Meszka, R. Nedela, A. RosaCirculants and the chromatic index of Steiner triple systemsMath. Slovaca 562006 371-378
161.L. Adamus, A.P. WojdaAlmost symmetric cycles in large digraphsGRAPHS AND COMBINATORICS222006443-452
162.L.PlachtaRemarks on invariants of finite order of knots and links in 3-spaceMat. Metody Fiz.-Mekh. Polya49(4)20067--18
163.S. Cichacz, T. Sulima-Samujłło, T. WiejaApplication of the Flash MX program to visualization of selected metric problemsProceedings of Symposium on Computional Geometry SCG'2005200521-25
164.E. Flandrin, H. Li, A. Marczyk, M. WoźniakA note on a generalisation of Ore's conditionGRAPHS AND COMBINATORICS212005213-216
165.Z.SkupieńDecompositions into two paths,DISCUSSIONES MATHEMATICAE GRAPH THEORY252005325-329
166.A.SzymańskiA Note on self-complementary 4-uniform hypergraphsOPUSCULA MATHEMATICA2522005319-323
167.A.P.Wojda, M.Woźniak, I.A.ZiołoOn self-complementary supergraphs of (n,n)-graphsDISCRETE MATHEMATICS292 (1-3)2005167-185
168.L.PlachtaOn orientability of singular foliations of surfaces in closed braid complementsMatematychně Studěď24(2)2005192-196
169.D. Fronček, M. MeszkaRound robin tournaments with one bye and no breaks in home-away patterns are uniqueMultidisciplinary Scheduling - Theory and Applications, eds: G. Kendall, E.K. Burke, S. Petrovic, M. Gendreau, Springer-Verlag2005331-340
170.A. ŻakDissection of a triangle into similar trianglesDISCRETE & COMPUTATIONAL GEOMETRY342005295-312
171.M.ZwonekA note on self-complementary hypergraphsOPUSCULA MATHEMATICA 25(2)2005351-354
172.J.Bucko, P.Mihok, JF.Sacle, M.WoźniakA note on maximal common subgraphs of the Dirac's family of graphsDISCUSSIONES MATHEMATICAE GRAPH THEORY25 (3)2005385-390
173.C. Lindner, M. Meszka, A. RosaOn a problem of Lo Faro concerning blocking sets in Steiner systems S(2,4,v)Congr. Numer. 174200523-27
174.L.PlachtaGenus of knots, constructible sets and Vassiliev invariantsDopovědě Nacěonal'noď Akademěď Nauk Ukraďny10200529-34
175.M. Klin, M. Meszka, S. Reichard, A. RosaThe smallest non-rank 3 strongly regular graphs which satisfy the 4-vertex conditionBayreuth.Math. Schr. 742005145-205
176.B. Orchel2-biplacement without fixed points of (p,q)-bipartite graphsOPUSCULA MATHEMATICA252005269-274
177.M. Hornak, S.Pcola, M.WoźniakOn the achromatic index of K_{q^2+q} for a prime qGRAPHS AND COMBINATORICS20 (2)2004191-203
178.S.Brandt, M.WoźniakOn cyclic packing of a treeGRAPHS AND COMBINATORICS20 (4)2004435-442
179.M.WoźniakPacking of graphs and permutation | a surveyDISCRETE MATHEMATICS2762004379-391
180.D.Froncek, Z.Ryjacek, Z.SkupieńOn traceability and 2-factors in claw-free graphsDISCUSSIONES MATHEMATICAE GRAPH THEORY24200455-71
181.R.Rosiek, M.WoźniakA note introducing Cayley graphs and groupcoset graphs generated by graph packingOPUSCULA MATHEMATICA24 (2)2004203-221
182.K.Taczuk, M.WoźniakA note on vertex-distinguishing index for some cubic graphsOPUSCULA MATHEMATICA24 (2)2004223-229
183.E. Flandrin, H. Li, A. Marczyk, M. WoźniakA note on pancyclism of highly connected graphsDISCRETE MATHEMATICS286200457-60
184.A. MarczykOn the structure of the set of cycle lengths in a hamiltonian graphDISCRETE MATHEMATICS2862004133-140
185.A. Dudek i AP WojdaP_msaturated bipartite graphs with minimum sizeDISCUSSIONES MATHEMATICAE GRAPH THEORY242004197-211
186.Z.Lonc, M.Meszka, Z.SkupieńEdge decompositions of multigraphs into 3-matchingsGRAPHS AND COMBINATORICS202004507-515
187.M. Meszka, A. RosaEmbedding Steiner triple systems into Steiner systems S(2,4,v)DISCRETE MATHEMATICS2742004199-212
188.A. MarczykOn the set of cycle lengths in a hamiltonian graph with a given maximum degreeGRAPHS AND COMBINATORICS202004517-529
189.S. CichaczZastosowanie teorii grafów w statyce - Applications of graph theory in staticsZESZYTY STUDENCKIEGO TOWARZYSTWA NAUKOWEGO200445-55
190.S. Cichacz, T. Sulima-SamujłłoApplication of B-spline to representation of selected lines and surfaces200421-26
191.J. Górska, Z. Skupień, Z. Majcher, J. MichaelA smallest irregular oriented graph containing a given diregular oneDISCRETE MATHEMATICS2862004
192.A.Görlich, M.Pilśniak, M.Woźniak, I. ZiołoA note on embedding graphs without short cycles DISCRETE MATHEMATICS286 (1-2)200475-77
193.A. Dudek i AP WojdaP_m saturated graphs with minimum sizeOPUSCULA MATHEMATICA200443-55
194.L.PlachtaC_n -moves, braid commutators and Vassiliev knot invariantsJ. Knot Theory Ramifications132004809-828
195.M.PilśniakPacking of three copies of a digraph into the transitive tournamentDISCUSSIONES MATHEMATICAE GRAPH THEORY24 (3)2004443-456
196.J. Kratochvil, Z. Lonc, M. Meszka, Z. SkupieńEdge decompositions of multigraphs into multi-2-pathsOPUSCULA MATHEMATICA24200497-102
197.AP WojdaA condition for a graph to contain a k-matchingDISCRETE MATHEMATICS2762004375-378
198.L.PlachtaDouble trivalent diagrams and n-hyperbolic knotsMethods of functional analysis and topology10(2)200443-56
199.M. Meszka, A. RosaPerfect 1-factorizations of K_{16} with nontrivial automorphism group J. Combin. Math. Combin. Comput.47200397-111
200.Z.Dziechcińska-Halamoda, Z.Majcher, J.Michael, Z.SkupieńLarge minimal irregular digraphsOPUSCULA MATHEMATICA22 Jan200321-24
201.J. Siagiová, M. MeszkaA covering construction for packing disjoint copies of the Hoffman-Singleton graph into K_{50}JOURNAL OF COMBINATORIAL DESIGNS112003408-412
202.B. Orchel2-placement of (p,q) - treesDISCUSSIONES MATHEMATICAE GRAPH THEORY23200323-36
203.A.Görlich, M.Pilśniak, M.WoźniakOn cyclically embeddable (n; n)- graphsDISCUSSIONES MATHEMATICAE GRAPH THEORY23 (1)200385-104
204.A.Marczyk, M.WoźniakCycles in hamiltonian graphs of prescribed maximum degreeDISCRETE MATHEMATICS2662003321-326
205.E. Mendelsohn, M. Meszka, A. RosaPacking Petersen graphs into K_{10}Bull. Inst. Combin. Appl. 392003 85-86
206.L.PlachtaThe combinatorics of gradient-like flows and foliations on closed surfaces: I.Topological classificationTOPOLOGY AND ITS APPLICATIONS128200363-91
207.L.Plachtan-trivial knots and the Alexander polynomial612003161-171
208.M.Hornak, M.WoźniakDecomposition of complete bipartite even graphs into closed trailsCZECHOSLOVAK MATHEMATICAL JOURNAL53 (1)2003127-134
209.M.WoźniakPacking two copies of a tree into planar graphOPUSCULA MATHEMATICA23200395-97
210.M.WoźniakPacking of graphs - some recent results and trendsStudies, Math. Series162003115-120
211.L.PlachtaIntersection homologies of pseudomanifolds with local homotopical conditions on links of strataNonlinear Oscillations6(4)2003475-481
212.M. Hornak, M.WoźniakArbitrarily vertex decomposable caterpillars with four or five leavesOPUSCULA MATHEMATICA23200349-62
213.M. Kouider, A. MarczykOn pancyclism in hamiltonian graphsDISCRETE MATHEMATICS2512002119-127
214.J. Ivančo, M. Meszka, Z. SkupieńDecomposition of multigraphs into parts with two edgesDISCUSSIONES MATHEMATICAE GRAPH THEORY222002113-121
215.L.PlachtaGeometric aspects of invariants of finite type of knots and links in S , Matematychně Studěď18(2)2002213-222
216.M.WoźniakOn cyclically embeddable (n,n-1) graphsDISCRETE MATHEMATICS2512002173-179
217.Z.SkupieńHamiltonicity of planar cubic multigraphsDISCRETE MATHEMATICS2512002163-168
218.J.Górska, Z.SkupieńInducing regularization of graphs, multigraphs and pseudographs ARS COMBINATORIA652002
219.J.Harant, M.Hornak, Z.SkupieńSeparating 3-cycles in plane triangulations,DISCRETE MATHEMATICS2392001127-136
220.S.Jendrol, Z.SkupieńLocal structures in plane maps and distance colouringsDISCRETE MATHEMATICS2362001167-177
221.E. Flandrin, H. Li, A. Marczyk, M. WoźniakA note on a new condition implying pancyclismDISCUSSIONES MATHEMATICAE GRAPH THEORY212001137-144
222.L.PlachtaVoltage graphs, weight systems and odd symmetryDISCRETE MATHEMATICS2362001281-313
223.L.PlachtaThe combinatorics of gradient-like flows and foliations on closed surfaces: III. The problem of realization and some estimatesMat. Metody Fiz.-Mekh. Polya44(3)200116 Jul
224.W. FrydrychNonhamiltonian 2-connected claw-free graphs with large 4-degree sumDISCRETE MATHEMATICS2762001123-130
225.Z.Majcher, J.Michael, J.Górska, Z.SkupieńThe minimum size of fully irregular oriented graphsDISCRETE MATHEMATICS2362001
226.R.Kalinowski, A.Marczyk, M.Meszka, A.P.WojdaPrefaceDISCRETE MATHEMATICS23620011
227.C.Bazgan, A.Harkat-Benhamdine, H.Li and M.WoźniakA note on the vertex-distinguishing proper colorings of graphs with large minimum degreeDISCRETE MATHEMATICS236200137-42
228.C.Bazgan, A.Harkat-Benhamdine, H.Li, M.WoźniakPartitioning vertices of 1-tough graphs into pathsTHEORETICAL COMPUTER SCIENCE263 (1-2)2001255-261
229. I.A.ZiołoSubforests of bipartite digraphs-the minimum conditionDISCRETE MATHEMATICS2362001351-365
230.L.PlachtaThe combinatorics of gradient-like flows and foliations on closed surfaces: II. The problem of realization and some estimatesMat. Metody Fiz.-Mekh. Polya44(2)200116 Jul
231.M.WoźniakNote on compact packing of a graphDISCRETE MATHEMATICS2332001205-210
232.H.Kheddouci, S.Marshall, J-F.Sacle, M.WoźniakOn the packing of three graphsDISCRETE MATHEMATICS2362001197-225
233.
234.
235.
236.
237.
238.
239.
240.
241.
242.
243.
244.
245.
246.
247.
248.
249.
250.
251.