- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j45 |      | Zdzislaw Skupien: Sums of powered characteristic roots count distance-independent circular sets. Discussiones Mathematicae Graph Theory 33(1): 217-229 (2013) |
| 2012 | ||
| j44 | | Mariusz Meszka, Zdzislaw Skupien: Decompositions of a complete multidigraph into almost arbitrary paths. Discussiones Mathematicae Graph Theory 32(2): 357-372 (2012) |
| 2011 | ||
| c1 | | |
| 2010 | ||
| j43 | | Zdenek Ryjácek, Zdzislaw Skupien, Petr Vrána: On cycle lengths in claw-free graphs with complete closure. Discrete Mathematics 310(3): 570-574 (2010) |
| 2009 | ||
| j42 | | Joanna Górska, Zdzislaw Skupien: Inducing regulation of any digraphs. Discrete Applied Mathematics 157(5): 947-952 (2009) |
| j41 | | Artur Fortuna, Zdzislaw Skupien, Andrzej Zak: Maximizing hamiltonian pairs and k-sets via numerous leaves in a tree. Discrete Mathematics 309(6): 1788-1792 (2009) |
| j40 | | Zdzislaw Skupien: Sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles. Discrete Mathematics 309(22): 6382-6390 (2009) |
| j39 | | Susan A. van Aardt, Frank Bullock, Joanna Górska, Zdzislaw Skupien: On detour homogeneous digraphs. Discrete Mathematics 309(22): 6415-6424 (2009) |
| j38 | | Mariusz Meszka, Zdzislaw Skupien: Decompositions of nearly complete digraphs into t isomorphic parts. Discussiones Mathematicae Graph Theory 29(3): 563-572 (2009) |
| 2008 | ||
| j37 | | Dorota Bród, Zdzislaw Skupien: Recurrence Among Trees with Most Numerous Efficient Dominating Sets. Discrete Mathematics & Theoretical Computer Science 10(1) (2008) |
| 2007 | ||
| j36 |  | Joanna Górska, Zdzislaw Skupien: Erratum to "Inducing regularization of graphs, multigraphs and pseudographs" [Ars Combinatoria 65 (2002), 129-133]. Ars Comb. 82 (2007) |
| j35 | | Zdzislaw Skupien: BCH codes and distance multi- or fractional colorings in hypercubes asymptotically. Discrete Mathematics 307(7-8): 990-1000 (2007) |
| j34 | | Joanna Górska, Zdzislaw Skupien: Trees with maximum number of maximal matchings. Discrete Mathematics 307(11-12): 1367-1377 (2007) |
| j33 | | Günter Schaar, Zdzislaw Skupien: Pairs of trees in tree-tree triangulations. Discrete Mathematics 307(11-12): 1499-1505 (2007) |
| j32 | | Zdzislaw Skupien: '3in1' enhanced: Three squares ways to "3in 1" GRAPHS. Discussiones Mathematicae Graph Theory 27(3): 561-563 (2007) |
| j31 | | Zyta Dziechcinska-Halamoda, Zofia Majcher, Jerzy Michael, Zdzislaw Skupien: A Sokoban-type game and arc deletion within irregular digraphs of all sizes. Discussiones Mathematicae Graph Theory 27(3): 611-622 (2007) |
| j30 | | Zdzislaw Skupien: Exponentially many hypohamiltonian snarks. Electronic Notes in Discrete Mathematics 28: 417-424 (2007) |
| 2006 | ||
| j29 | | Zyta Dziechcinska-Halamoda, Zofia Majcher, Jerzy Michael, Zdzislaw Skupien: Extremum degree sets of irregular oriented graphs and pseudodigraphs. Discussiones Mathematicae Graph Theory 26(2): 317-333 (2006) |
| j28 | | Zdzislaw Skupien: On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles. Electronic Notes in Discrete Mathematics 24: 231-235 (2006) |
| j27 | | Mariusz Meszka, Zdzislaw Skupien: Decompositions of a complete multidigraph into nonhamiltonian paths. Journal of Graph Theory 51(1): 82-91 (2006) |
| 2005 | ||
| j26 | | Zdzislaw Skupien: Decompositions into two paths. Discussiones Mathematicae Graph Theory 25(3): 325-329 (2005) |
| 2004 | ||
| j25 | | Joanna Górska, Zdzislaw Skupien, Zofia Majcher, Jerzy Michael: A smallest irregular oriented graph containing a given diregular one. Discrete Mathematics 286(1-2): 79-88 (2004) |
| j24 | | Dalibor Froncek, Zdenek Ryjácek, Zdzislaw Skupien: On traceability and 2-factors in claw-free graphs. Discussiones Mathematicae Graph Theory 24(1): 55-71 (2004) |
| j23 | | Zbigniew Lonc, Mariusz Meszka, Zdzislaw Skupien: Edge Decompositions of Multigraphs into 3-Matchings. Graphs and Combinatorics 20(4): 507-515 (2004) |
| 2002 | ||
| j22 | | Joanna Górska, Zdzislaw Skupien: Inducing regularization of graphs, multigraphs and pseudographs. Ars Comb. 65 (2002) |
| j21 | | Zdzislaw Skupien: Hamiltonicity of planar cubic multigraphs. Discrete Mathematics 251(1-3): 163-168 (2002) |
| j20 | | Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien: Decompositions of multigraphs into parts with two edges. Discussiones Mathematicae Graph Theory 22(1): 113-121 (2002) |
| j19 | | Zdzislaw Skupien: Clique parts independent of remainders. Discussiones Mathematicae Graph Theory 22(2): 361-361 (2002) |
| 2001 | ||
| j18 | | Stanislav Jendrol, Zdzislaw Skupien: Local structures in plane maps and distance colourings. Discrete Mathematics 236(1-3): 167-177 (2001) |
| j17 | | Zofia Majcher, Jerzy Michael, Joanna Górska, Zdzislaw Skupien: The minimum size of fully irregular oriented graphs. Discrete Mathematics 236(1-3): 263-272 (2001) |
| j16 | | Jochen Harant, Mirko Hornák, Zdzislaw Skupien: Separating 3-cycles in plane triangulations. Discrete Mathematics 239(1-3): 127-136 (2001) |
| j15 | | Zdzislaw Skupien: BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically. Electronic Notes in Discrete Mathematics 8: 94-97 (2001) |
| 2000 | ||
| j14 | | Pavol Gvozdjak, Peter Horák, Mariusz Meszka, Zdzislaw Skupien: On the Strong Chromatic Index of Cyclic Multigraphs. Discrete Applied Mathematics 99(1-3): 23-38 (2000) |
| j13 | | Mariusz Meszka, Zdzislaw Skupien: On some third parts of nearly complete digraphs. Discrete Mathematics 212(1-2): 129-139 (2000) |
| 1999 | ||
| j12 | | Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien: Decomposition of Multigraphs into Isomorphic Graphs with Two Edges. Ars Comb. 51 (1999) |
| j11 | | Zdzislaw Skupien: On distance edge colourings of a cyclic multigraph. Discussiones Mathematicae Graph Theory 19(2): 251-252 (1999) |
| j10 | | Zdzislaw Skupien: Problems on fully irregular digraphs. Discussiones Mathematicae Graph Theory 19(2): 253-255 (1999) |
| 1998 | ||
| j9 | | Mariusz Meszka, Zdzislaw Skupien: Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs. Combinatorica 18(3): 413-424 (1998) |
| j8 | | Waclaw Frydrych, Zdzislaw Skupien: Non-traceability of large connected claw-free graphs. Journal of Graph Theory 27(2): 75-86 (1998) |
| 1997 | ||
| j7 | | Stanislav Jendrol, Zdzislaw Skupien: Exact Numbers of Longest Cycles with Empty Intersection. Eur. J. Comb. 18(5): 575-578 (1997) |
| 1996 | ||
| j6 | | Zdzislaw Skupien: Smallest sets of Longest Paths with Empty Intersection. Combinatorics, Probability & Computing 5: 429-436 (1996) |
| 1995 | ||
| j5 | | Zdzislaw Skupien: Some maximum multigraphs and adge/vertex distance colourings. Discussiones Mathematicae Graph Theory 15(1): 89-106 (1995) |
| 1993 | ||
| j4 | | Zdzislaw Skupien: The complete graph t -packings and t -coverings. Graphs and Combinatorics 9(2-4): 353-363 (1993) |
| 1991 | ||
| j3 | | Antoni Marczyk, Zdzislaw Skupien: Maximum nonhamiltonian tough graphs. Discrete Mathematics 96(3): 213-220 (1991) |
| 1990 | ||
| j2 | | Rafal Kalinowski, Zdzislaw Skupien: Large Isaacs' graphs are maximally non- Hamilton-connected. Discrete Mathematics 82(1): 101-104 (1990) |
| 1982 | ||
| j1 | | Janusz Jamrozik, Rafal Kalinowski, Zdzislaw Skupien: A catalogue of small maximal nonhamiltonian graphs. Discrete Mathematics 39(2): 229-234 (1982) |
Colors in the list of coauthors
Last update Thu May 23 00:06:29 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page