Zdzislaw Skupien

Zyta Dziechcinska-Halamoda

Discuss. Math. Graph Theory, 2023

Extremal irregular digraphs.

[BibT_eX]

[DOI]

,

,

,

,

Discuss. Math. Graph Theory, 2018

Majorization and the minimum number of dominating sets.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Sums of powered characteristic roots count distance-independent circular sets.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2013

Counting maximal distance-independent sets in grid graphs.

[BibT_eX]

[DOI]

Reinhardt Euler

,

Pawel Oleksik

,

Discuss. Math. Graph Theory, 2013

Decompositions of a complete multidigraph into almost arbitrary paths.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2012

On cycle lengths in claw-free graphs with complete closure.

[BibT_eX]

[DOI]

Zdenek Ryjácek

,

,

Petr Vrána

Discret. Math., 2010

Decompositions of nearly complete digraphs into t isomorphic parts.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2009

Maximizing hamiltonian pairs and k-sets via numerous leaves in a tree.

[BibT_eX]

[DOI]

Artur Fortuna

,

,

Andrzej Zak

Discret. Math., 2009

On detour homogeneous digraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2009

Inducing regulation of any digraphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2009

Recurrence Among Trees with Most Numerous Efficient Dominating Sets.

[BibT_eX]

[DOI]

Dorota Bród

,

Discret. Math. Theor. Comput. Sci., 2008

Rainbow regular order of graphs.

[BibT_eX]

[DOI]

,

Andrzej Zak

Australas. J Comb., 2008

Exponentially many hypohamiltonian snarks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

'3in1' enhanced: Three squares ways to "3in 1" GRAPHS.

[BibT_eX]

[DOI]

Zyta Dziechcinska-Halamoda

Discuss. Math. Graph Theory, 2007

A Sokoban-type game and arc deletion within irregular digraphs of all sizes.

[BibT_eX]

[DOI]

,

Zofia Majcher

,

Jerzy Michael

,

Discuss. Math. Graph Theory, 2007

BCH codes and distance multi- or fractional colorings in hypercubes asymptotically.

[BibT_eX]

[DOI]

Discret. Math., 2007

Pairs of trees in tree-tree triangulations.

[BibT_eX]

[DOI]

Günter Schaar

,

Discret. Math., 2007

Trees with maximum number of maximal matchings.

[BibT_eX]

[DOI]

,

Discret. Math., 2007

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

[BibT_eX]

,

Ars Comb., 2007

Decompositions of a complete multidigraph into nonhamiltonian paths.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2006

On sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles.

[BibT_eX]

[DOI]

Zyta Dziechcinska-Halamoda

Electron. Notes Discret. Math., 2006

Extremum degree sets of irregular oriented graphs and pseudodigraphs.

[BibT_eX]

[DOI]

,

Zofia Majcher

,

Jerzy Michael

,

Discuss. Math. Graph Theory, 2006

Trees with extremal numbers of dominating sets.

[BibT_eX]

[DOI]

Dorota Bród

,

Australas. J Comb., 2006

Decompositions into two paths.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2005

Edge Decompositions of Multigraphs into 3-Matchings.

[BibT_eX]

[DOI]

Zbigniew Lonc

,

,

Graphs Comb., 2004

On traceability and 2-factors in claw-free graphs.

[BibT_eX]

[DOI]

Dalibor Froncek

,

Zdenek Ryjácek

,

Discuss. Math. Graph Theory, 2004

A smallest irregular oriented graph containing a given diregular one.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2004

Clique parts independent of remainders.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2002

Decompositions of multigraphs into parts with two edges.

[BibT_eX]

[DOI]

Jaroslav Ivanco

,

,

Discuss. Math. Graph Theory, 2002

Hamiltonicity of planar cubic multigraphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

Inducing regularization of graphs, multigraphs and pseudographs.

[BibT_eX]

,

Ars Comb., 2002

BCH codes are good for distance multicolorings with radio frequencies in hypercubes asymptotically.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

The minimum size of fully irregular oriented graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2001

Local structures in plane maps and distance colourings.

[BibT_eX]

[DOI]

Stanislav Jendrol'

,

Discret. Math., 2001

Separating 3-cycles in plane triangulations.

[BibT_eX]

[DOI]

Jochen Harant

,

Mirko Hornák

,

Discret. Math., 2001

On some third parts of nearly complete digraphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2000

On the Strong Chromatic Index of Cyclic Multigraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2000

Problems on fully irregular digraphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1999

On distance edge colourings of a cyclic multigraph.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1999

Decomposition of Multigraphs into Isomorphic Graphs with Two Edges.

[BibT_eX]

Jaroslav Ivanco

,

,

Ars Comb., 1999

Non-traceability of large connected claw-free graphs.

[BibT_eX]

[DOI]

Waclaw Frydrych

,

J. Graph Theory, 1998

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

[BibT_eX]

[DOI]

,

Comb., 1998

Exact Numbers of Longest Cycles with Empty Intersection.

[BibT_eX]

[DOI]

Stanislav Jendrol'

,

Eur. J. Comb., 1997

Smallest sets of Longest Paths with Empty Intersection.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

Some maximum multigraphs and adge/vertex distance colourings.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1995

The complete graph <i>t</i> -packings and <i>t</i> -coverings.

[BibT_eX]

[DOI]

Graphs Comb., 1993

Maximum nonhamiltonian tough graphs.

[BibT_eX]

[DOI]

Antoni Marczyk

,

Discret. Math., 1991

Large Isaacs' graphs are maximally non- Hamilton-connected.

[BibT_eX]

[DOI]

Rafal Kalinowski

,

Discret. Math., 1990

A catalogue of small maximal nonhamiltonian graphs.

[BibT_eX]

[DOI]

Janusz Jamrozik

,

Rafal Kalinowski

,