The SCEAS System
| |||||||

## Search the dblp DataBase
Zdzislaw Skupien:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Joanna Górska, Zdzislaw Skupien
**Inducing regularization of graphs, multigraphs and pseudographs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:65, n:, pp:- [Journal] - Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien
**Decomposition of Multigraphs into Isomorphic Graphs with Two Edges.**[Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:51, n:, pp:- [Journal] - Mariusz Meszka, Zdzislaw Skupien
**Self-Converse and Oriented Graphs among the Third Parts of Nearly Complete Digraphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1998, v:18, n:3, pp:413-424 [Journal] - Zdzislaw Skupien
**Smallest sets of Longest Paths with Empty Intersection.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:429-436 [Journal] - Pavol Gvozdjak, Peter Horák, Mariusz Meszka, Zdzislaw Skupien
**On the Strong Chromatic Index of Cyclic Multigraphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:23-38 [Journal] - Joanna Górska, Zdzislaw Skupien, Zofia Majcher, Jerzy Michael
**A smallest irregular oriented graph containing a given diregular one.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:286, n:1-2, pp:79-88 [Journal] - Jochen Harant, Mirko Horák, Zdzislaw Skupien
**Separating 3-cycles in plane triangulations.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:239, n:1-3, pp:127-136 [Journal] - Stanislav Jendrol, Zdzislaw Skupien
**Local structures in plane maps and distance colourings.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:236, n:1-3, pp:167-177 [Journal] - Zofia Majcher, Jerzy Michael, Joanna Górska, Zdzislaw Skupien
**The minimum size of fully irregular oriented graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:236, n:1-3, pp:263-272 [Journal] - Mariusz Meszka, Zdzislaw Skupien
**On some third parts of nearly complete digraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:212, n:1-2, pp:129-139 [Journal] - Zdzislaw Skupien
**Hamiltonicity of planar cubic multigraphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:251, n:1-3, pp:163-168 [Journal] - Zdzislaw Skupien
**BCH codes and distance multi- or fractional colorings in hypercubes asymptotically.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:7-8, pp:990-1000 [Journal] - Günter Schaar, Zdzislaw Skupien
**Pairs of trees in tree-tree triangulations.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:11-12, pp:1499-1505 [Journal] - Joanna Górska, Zdzislaw Skupien
**Trees with maximum number of maximal matchings.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:11-12, pp:1367-1377 [Journal] - Stanislav Jendrol, Zdzislaw Skupien
**Exact Numbers of Longest Cycles with Empty Intersection.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1997, v:18, n:5, pp:575-578 [Journal] - Zbigniew Lonc, Mariusz Meszka, Zdzislaw Skupien
**Edge Decompositions of Multigraphs into 3-Matchings.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2004, v:20, n:4, pp:507-515 [Journal] - Mariusz Meszka, Zdzislaw Skupien
**Decompositions of a complete multidigraph into nonhamiltonian paths.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2006, v:51, n:1, pp:82-91 [Journal] - Janusz Jamrozik, Rafal Kalinowski, Zdzislaw Skupien
**A catalogue of small maximal nonhamiltonian graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1982, v:39, n:2, pp:229-234 [Journal] - Rafal Kalinowski, Zdzislaw Skupien
**Large Isaacs' graphs are maximally non- Hamilton-connected.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:82, n:1, pp:101-104 [Journal] - Antoni Marczyk, Zdzislaw Skupien
**Maximum nonhamiltonian tough graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:96, n:3, pp:213-220 [Journal] **Erratum to "Inducing regularization of graphs, multigraphs and pseudographs" [Ars Combinatoria 65 (2002), 129-133].**[Citation Graph (, )][DBLP]**Inducing regulation of any digraphs.**[Citation Graph (, )][DBLP]**On detour homogeneous digraphs.**[Citation Graph (, )][DBLP]**Sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles.**[Citation Graph (, )][DBLP]**Maximizing hamiltonian pairs and k-sets via numerous leaves in a tree.**[Citation Graph (, )][DBLP]**On cycle lengths in claw-free graphs with complete closure.**[Citation Graph (, )][DBLP]**Recurrence Among Trees with Most Numerous Efficient Dominating Sets.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |