default search action
Zdzislaw Skupien
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j51]Zdzislaw Skupien:
The Petersen and Heawood graphs make up graphical twins via induced matchings. Discuss. Math. Graph Theory 43(3): 677-683 (2023)
2010 – 2019
- 2018
- [j50]Zyta Dziechcinska-Halamoda, Joanna Górska, Zofia Majcher, Jerzy Michael, Zdzislaw Skupien:
Extremal irregular digraphs. Discuss. Math. Graph Theory 38(3): 791-800 (2018) - 2014
- [j49]Zdzislaw Skupien:
Majorization and the minimum number of dominating sets. Discret. Appl. Math. 165: 295-302 (2014) - 2013
- [j48]Zdzislaw Skupien:
Sums of powered characteristic roots count distance-independent circular sets. Discuss. Math. Graph Theory 33(1): 217-229 (2013) - [j47]Reinhardt Euler, Pawel Oleksik
, Zdzislaw Skupien:
Counting maximal distance-independent sets in grid graphs. Discuss. Math. Graph Theory 33(3): 531-557 (2013) - 2012
- [j46]Mariusz Meszka, Zdzislaw Skupien:
Decompositions of a complete multidigraph into almost arbitrary paths. Discuss. Math. Graph Theory 32(2): 357-372 (2012) - 2011
- [c1]Zdzislaw Skupien:
Majorization and the minimum number of dominating sets. CTW 2011: 252-254 - 2010
- [j45]Zdenek Ryjácek, Zdzislaw Skupien, Petr Vrána
On cycle lengths in claw-free graphs with complete closure. Discret. Math. 310(3): 570-574 (2010)
2000 – 2009
- 2009
- [j44]Joanna Górska, Zdzislaw Skupien:
Inducing regulation of any digraphs. Discret. Appl. Math. 157(5): 947-952 (2009) - [j43]Artur Fortuna, Zdzislaw Skupien, Andrzej Zak:
Maximizing hamiltonian pairs and k-sets via numerous leaves in a tree. Discret. Math. 309(6): 1788-1792 (2009) - [j42]Zdzislaw Skupien:
Sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles. Discret. Math. 309(22): 6382-6390 (2009) - [j41]Susan A. van Aardt, Frank Bullock, Joanna Górska, Zdzislaw Skupien:
On detour homogeneous digraphs. Discret. Math. 309(22): 6415-6424 (2009) - [j40]Mariusz Meszka, Zdzislaw Skupien:
Decompositions of nearly complete digraphs into t isomorphic parts. Discuss. Math. Graph Theory 29(3): 563-572 (2009) - 2008
- [j39]Zdzislaw Skupien, Andrzej Zak:
Rainbow regular order of graphs. Australas. J Comb. 42: 115-128 (2008) - [j38]Dorota Bród, Zdzislaw Skupien:
Recurrence Among Trees with Most Numerous Efficient Dominating Sets. Discret. Math. Theor. Comput. Sci. 10(1) (2008) - 2007
- [j37]Joanna Górska, Zdzislaw Skupien:
Erratum to "Inducing regularization of graphs, multigraphs and pseudographs" [Ars Combinatoria 65 (2002), 129-133]. Ars Comb. 82 (2007) - [j36]Zdzislaw Skupien:
BCH codes and distance multi- or fractional colorings in hypercubes asymptotically. Discret. Math. 307(7-8): 990-1000 (2007) - [j35]Joanna Górska, Zdzislaw Skupien:
Trees with maximum number of maximal matchings. Discret. Math. 307(11-12): 1367-1377 (2007) - [j34]Günter Schaar, Zdzislaw Skupien:
Pairs of trees in tree-tree triangulations. Discret. Math. 307(11-12): 1499-1505 (2007) - [j33]Zdzislaw Skupien:
'3in1' enhanced: Three squares ways to "3in 1" GRAPHS. Discuss. Math. Graph Theory 27(3): 561-563 (2007) - [j32]Zyta Dziechcinska-Halamoda, Zofia Majcher, Jerzy Michael, Zdzislaw Skupien:
A Sokoban-type game and arc deletion within irregular digraphs of all sizes. Discuss. Math. Graph Theory 27(3): 611-622 (2007) - [j31]Zdzislaw Skupien:
Exponentially many hypohamiltonian snarks. Electron. Notes Discret. Math. 28: 417-424 (2007) - 2006
- [j30]Dorota Bród, Zdzislaw Skupien:
Trees with extremal numbers of dominating sets. Australas. J Comb. 35: 273-290 (2006) - [j29]Zyta Dziechcinska-Halamoda, Zofia Majcher, Jerzy Michael, Zdzislaw Skupien:
Extremum degree sets of irregular oriented graphs and pseudodigraphs. Discuss. Math. Graph Theory 26(2): 317-333 (2006) - [j28]Zdzislaw Skupien:
On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles. Electron. Notes Discret. Math. 24: 231-235 (2006) - [j27]Mariusz Meszka, Zdzislaw Skupien:
Decompositions of a complete multidigraph into nonhamiltonian paths. J. Graph Theory 51(1): 82-91 (2006) - 2005
- [j26]Zdzislaw Skupien:
Decompositions into two paths. Discuss. Math. 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. Discret. Math. 286(1-2): 79-88 (2004) - [j24]Dalibor Froncek, Zdenek Ryjácek, Zdzislaw Skupien:
On traceability and 2-factors in claw-free graphs. Discuss. Math. Graph Theory 24(1): 55-71 (2004) - [j23]Zbigniew Lonc
Edge Decompositions of Multigraphs into 3-Matchings. Graphs Comb. 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. Discret. Math. 251(1-3): 163-168 (2002) - [j20]Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien:
Decompositions of multigraphs into parts with two edges. Discuss. Math. Graph Theory 22(1): 113-121 (2002) - [j19]Zdzislaw Skupien:
Clique parts independent of remainders. Discuss. Math. Graph Theory 22(2): 361-361 (2002) - 2001
- [j18]Stanislav Jendrol'
Local structures in plane maps and distance colourings. Discret. Math. 236(1-3): 167-177 (2001) - [j17]Zofia Majcher, Jerzy Michael, Joanna Górska, Zdzislaw Skupien:
The minimum size of fully irregular oriented graphs. Discret. Math. 236(1-3): 263-272 (2001) - [j16]Jochen Harant, Mirko Hornák
Separating 3-cycles in plane triangulations. Discret. Math. 239(1-3): 127-136 (2001) - [j15]Zdzislaw Skupien:
BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically. Electron. Notes Discret. Math. 8: 94-97 (2001) - 2000
- [j14]Pavol Gvozdjak, Peter Horák, Mariusz Meszka, Zdzislaw Skupien:
On the Strong Chromatic Index of Cyclic Multigraphs. Discret. Appl. Math. 99(1-3): 23-38 (2000) - [j13]Mariusz Meszka, Zdzislaw Skupien:
On some third parts of nearly complete digraphs. Discret. Math. 212(1-2): 129-139 (2000)
1990 – 1999
- 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. Discuss. Math. Graph Theory 19(2): 251-252 (1999) - [j10]Zdzislaw Skupien:
Problems on fully irregular digraphs. Discuss. Math. 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. Comb. 18(3): 413-424 (1998) - [j8]Waclaw Frydrych, Zdzislaw Skupien:
Non-traceability of large connected claw-free graphs. J. Graph Theory 27(2): 75-86 (1998) - 1997
- [j7]Stanislav Jendrol'
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. Comb. Probab. Comput. 5: 429-436 (1996) - 1995
- [j5]Zdzislaw Skupien:
Some maximum multigraphs and adge/vertex distance colourings. Discuss. Math. Graph Theory 15(1): 89-106 (1995) - 1993
- [j4]Zdzislaw Skupien:
The complete graph t -packings and t -coverings. Graphs Comb. 9(2-4): 353-363 (1993) - 1991
- [j3]Antoni Marczyk, Zdzislaw Skupien:
Maximum nonhamiltonian tough graphs. Discret. Math. 96(3): 213-220 (1991) - 1990
- [j2]Rafal Kalinowski, Zdzislaw Skupien:
Large Isaacs' graphs are maximally non- Hamilton-connected. Discret. Math. 82(1): 101-104 (1990)
1980 – 1989
- 1982
- [j1]Janusz Jamrozik, Rafal Kalinowski, Zdzislaw Skupien:
A catalogue of small maximal nonhamiltonian graphs. Discret. Math. 39(2): 229-234 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: