Zdzislaw Skupien

According to our database1, Zdzislaw Skupien authored at least 49 papers between 1982 and 2018.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Extremal irregular digraphs.
Discuss. Math. Graph Theory, 2018

Majorization and the minimum number of dominating sets.
Discret. Appl. Math., 2014

Sums of powered characteristic roots count distance-independent circular sets.
Discuss. Math. Graph Theory, 2013

Counting maximal distance-independent sets in grid graphs.
Discuss. Math. Graph Theory, 2013

Decompositions of a complete multidigraph into almost arbitrary paths.
Discuss. Math. Graph Theory, 2012

On cycle lengths in claw-free graphs with complete closure.
Discret. Math., 2010

Decompositions of nearly complete digraphs into t isomorphic parts.
Discuss. Math. Graph Theory, 2009

Maximizing hamiltonian pairs and k-sets via numerous leaves in a tree.
Discret. Math., 2009

On detour homogeneous digraphs.
Discret. Math., 2009

Inducing regulation of any digraphs.
Discret. Appl. Math., 2009

Recurrence Among Trees with Most Numerous Efficient Dominating Sets.
Discret. Math. Theor. Comput. Sci., 2008

Rainbow regular order of graphs.
Australas. J Comb., 2008

Exponentially many hypohamiltonian snarks.
Electron. Notes Discret. Math., 2007

'3in1' enhanced: Three squares ways to "3in 1" GRAPHS.
Discuss. Math. Graph Theory, 2007

A Sokoban-type game and arc deletion within irregular digraphs of all sizes.
Discuss. Math. Graph Theory, 2007

BCH codes and distance multi- or fractional colorings in hypercubes asymptotically.
Discret. Math., 2007

Pairs of trees in tree-tree triangulations.
Discret. Math., 2007

Trees with maximum number of maximal matchings.
Discret. Math., 2007

Erratum to "Inducing regularization of graphs, multigraphs and pseudographs" [Ars Combinatoria 65 (2002), 129-133].
Ars Comb., 2007

Decompositions of a complete multidigraph into nonhamiltonian paths.
J. Graph Theory, 2006

On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles.
Electron. Notes Discret. Math., 2006

Extremum degree sets of irregular oriented graphs and pseudodigraphs.
Discuss. Math. Graph Theory, 2006

Trees with extremal numbers of dominating sets.
Australas. J Comb., 2006

Decompositions into two paths.
Discuss. Math. Graph Theory, 2005

Edge Decompositions of Multigraphs into 3-Matchings.
Graphs Comb., 2004

On traceability and 2-factors in claw-free graphs.
Discuss. Math. Graph Theory, 2004

A smallest irregular oriented graph containing a given diregular one.
Discret. Math., 2004

Clique parts independent of remainders.
Discuss. Math. Graph Theory, 2002

Decompositions of multigraphs into parts with two edges.
Discuss. Math. Graph Theory, 2002

Hamiltonicity of planar cubic multigraphs.
Discret. Math., 2002

Inducing regularization of graphs, multigraphs and pseudographs.
Ars Comb., 2002

BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically.
Electron. Notes Discret. Math., 2001

The minimum size of fully irregular oriented graphs.
Discret. Math., 2001

Local structures in plane maps and distance colourings.
Discret. Math., 2001

Separating 3-cycles in plane triangulations.
Discret. Math., 2001

On some third parts of nearly complete digraphs.
Discret. Math., 2000

On the Strong Chromatic Index of Cyclic Multigraphs.
Discret. Appl. Math., 2000

Problems on fully irregular digraphs.
Discuss. Math. Graph Theory, 1999

On distance edge colourings of a cyclic multigraph.
Discuss. Math. Graph Theory, 1999

Decomposition of Multigraphs into Isomorphic Graphs with Two Edges.
Ars Comb., 1999

Non-traceability of large connected claw-free graphs.
J. Graph Theory, 1998

Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs.
Comb., 1998

Exact Numbers of Longest Cycles with Empty Intersection.
Eur. J. Comb., 1997

Smallest sets of Longest Paths with Empty Intersection.
Comb. Probab. Comput., 1996

Some maximum multigraphs and adge/vertex distance colourings.
Discuss. Math. Graph Theory, 1995

The complete graph <i>t</i> -packings and <i>t</i> -coverings.
Graphs Comb., 1993

Maximum nonhamiltonian tough graphs.
Discret. Math., 1991

Large Isaacs' graphs are maximally non- Hamilton-connected.
Discret. Math., 1990

A catalogue of small maximal nonhamiltonian graphs.
Discret. Math., 1982