|
[1]
| Über endliche, ebene Eulersche und paare, kubische Graphen.
Monatshefte f. Mathematik 74 (1970), 410-420.
|
|
[2]
| Sätze über Eulersche Graphen mit speziellen Eigenschaften,
Sätze über die Existenz von Hamiltonschen Linien.
Sitzungsberichte d. Österr. Akademie d.
Wissenschaften, math.-nat. Klasse, Abt. II, 178. Bd., 1.-3.
Heft (1969), 77-123.
|
|
[3]
| Über Hamiltonsche Linien im Quadrat kubischer und pseudokubischer
Graphen.
Mathematische Nachrichten, Bd. 49, Heft 1-6 (1971),
163-171.
|
|
[4]
| Die Struktur der Automorphismen spezieller, endlicher, ebener,
dreifach-knotenzusammenhängender Graphen.
Compositio Mathematica 23, Fasc. 4 (1971), 435-444.
|
|
[5]
| Fixpunkteigenschaften von Automorphismen spezieller, endlicher, ebener,
dreifach-knotenzusammenhängender Graphen.
Compositio Mathematica 23, Fasc. 4 (1971), 445-452.
|
|
[6]
| The Square of Every Nonseparable Graph is Hamiltonian.
Bulletin of the American Mathematical Society, (Nov.
1971), 77, No. 6, 1052-1054.
|
|
[7]
| With H. V. Kronk.
Hamiltonsche Linien im Quadrat brückenloser Graphen mit
Artikulationen.
Monatshefte f. Mathematik 76 (1972), 112-117.
|
|
[8]
| Die Bestimmung der kubischen Graphen mit Hamiltonschem Quadrat.
Mathematische Nachrichten 55 (1973), Heft 1-6, 213-221.
|
|
[9]
| The Uniquely Embeddable Planar Graphs.
Discrete Mathematics 4, No. 4 (April 1973), 347-358.
|
|
[10]
| On Spanning Subgraphs of a Connected Bridgeless Graph and Their
Application to DT-Graphs.
Journal of Combinatorial Theory 16, No. 1 (1974),
17-28.
|
|
[11]
| The Square of Every Two-Connected Graph is Hamiltonian.
Journal of Combinatorial Theory 16, No. 1 (1974),
29-34.
|
|
[12]
| With P. Roy.
Distribution of Points of Odd Degree of Certain
Triangulations in the Plane.
Monatshefte f. Mathematik 78 (1974), 385-390.
|
|
[13]
| The Importance of Being Euler.
Abhandlungen a. d. Mathem. Seminar der Universität
Hamburg, Bd. 42 (Nov. 1974), 90-99.
|
|
[14]
| On Regulating Sets and the Disparity of Planar Cubic Graphs.
Canad. Math. Bull. 17 (3) (1974), 367-374.
|
|
[15]
| With D. P. Geller and F. Harary.
Outerplanar Graphs and Weak Duals.
Journal of the Indian Math. Soc. 38 (1974), 215-219.
|
|
[16]
| A Note on Line Colorings of Cubic Graphs.
Arch. Math. (Brno) 4 (1974), 195-198.
|
|
[17]
| Gedanken zur Vier-Farben-Vermutung.
Monatshefte f. Mathematik, 79 (1975), 201-211.
|
|
[18]
| With A. M. Hobbs.
A Necessary Condition for the Square of a Graph to be
Hamiltonian.
Journal of Combinatorial Theory 19, No. 2 (Oct. 1975),
97-118.
|
|
[19]
| With A. M. Hobbs.
Hamiltonian Total Graphs.
Mathematische Nachrichten, Bd. 68 (1975), 59-82.
|
|
[20]
| Hamiltonsche totale Graphen von ebenen Graphen.
Mathematische Nachrichten, Bd. 68 (1975), 83-91.
|
|
[21]
| Hamiltonian Squares of Graphs; in: Recent Advances in Graph
Theory.
Proceedings of the Symposium held in Prague, June 1974,
Academia Praha 1975, 197-206.
|
|
[22]
| Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und
den Satz von Petersen.
Monatshefte f. Mathematik 81 (1976), 267-278.
|
|
[23]
| In the Square of Graphs, Hamiltonicity and Pancyclicity,
Hamiltonian Connectedness and Panconnectedness are Equivalent
Concepts.
Monatshefte f. Mathematik 82 (1976), 125-149.
|
|
[24]
| With A. M. Hobbs.
Hamiltonian Cycles in Squares of Vertex-Unicyclic Graphs.
Canad. Math. Bull. 19 (2) (1976), 169-172.
|
|
[25]
| On the Equivalence of Mealy-Type and Moore-Type Automata and a
Relation Between Reducibility and Moore-Reducibility.
JCSS, 14, No. 1 (1977), 1-16.
|
|
[26]
| With P. D. Vestergaard.
Value-true Walks in Finite, Connected, Valuated Graphs.
Monatshefte f. Mathematik 83 (1977), 1-8.
|
|
[27]
| With W. Imrich.
Transitive Planar Graphs.
Mathematica Slovaca 29, No. 2 (1979), 97-106.
|
|
[28]
| With A. R. Bazelow.
Representations of Finite Partial Orderings by Binary
Codes Combined with Sequential Decision Mechanisms with
Applications to Digital Fault Diagnosis.
in: Second International Conference on Combinatorial
Mathematics (A. Gewirtz and L. V. Quintas, Eds.)
ANYAA9, 319 (1979), 188-206.
|
|
[29]
| The Reconstruction of Line-Critical Blocks.
Ars Combinatoria 7 (1979), 223-254.
|
|
[30]
| With V. Chvatal, J. Sheehan, and C. Thomassen.
Three-Regular Subgraphs of Four-Regular Graphs.
Journal of Graph Theory 3 (1979), 371-386.
|
|
[31]
| Eulersche Linien und Kreisüberdeckungen, die vorgegebene
Durchgänge in den Kanten vermeiden.
Journal of Combinatorial Theory B 29, No. 2 (1980),
145-167.
|
|
[32]
| With J. Sheehan.
Three-Regular Subgraphs of Four-Regular Graphs. The
Case lambdac = 8.
unpublished.
|
|
[33]
| Even Cycles with Prescribed Chords in Planar Cubic Graphs.
Discrete Mathematics, 44, (1983), 275-280.
|
|
[34]
| Eulerian Graphs.
in: Selected Topics in Graph Theory 2 (L. Beineke
and R. Wilson, Eds.), Academic Press Inc., London (1983),
17-53.
|
|
[35]
| A Way of Enumerating Eulerian Trails in a Connected Eulerian
Graph.
Ars Combinatoria 16B (1983), 177-196.
|
|
[36]
| From the Bridges of Königsberg to the Chinese Postman.
Proceedings of the Second Symposium of the Southern
Africa Mathematical Sciences Association (1983), 8-32.
|
|
[37]
| Cycle Decompositions, 2-Coverings, Removable Cycles, and the
4CD.
in: Progress in Graph Theory (J. A. Bondy, U. S.
R. Murty, Eds.), Academic Press (1984), 233-246.
|
|
[38]
| With B. Jackson.
Removable Cycles in Planar Graphs.
Journal of the London Math. Soc. (2), 31 (1985),
193-199.
|
|
[39]
| With G. Meigu.
On the Minimum Weighted Cycle Covering Problem for
Planar Graphs.
Ars Combinatoria 20 (1985), 61-67.
|
|
[40]
| Proof of the Strong 2-Cover Conjecture for Planar Graphs.
Journal of Combinatorial Theory B 40, No. 2 (1986),
229-230.
|
|
[41]
| With B. Jackson.
Compatible Path-Cycle-Decompositions of Plane Graphs.
Journal of Combinatorial Theory B 42, No. 1 (1987),
94-121.
|
|
[42]
| With L. D. Andersen and B. Jackson.
Removable Edges in Cyclically 4-Edge-Connected Cubic
Graphs.
Graphs and Combinatorics 4 (1988), 1-21.
|
|
[43]
| Some Blood, Sweat, but no Tears in Eulerian Graph Theory.
Congressus Numer. 63 (1988), 8-48.
|
|
[44]
| The Prism of a 2-Connected Planar Cubic Graph is Hamiltonian (a
Proof Independent of the Four Colour Theorem).
Annals Discrete Math. 41 (1989), 141-170.
|
|
[45]
| Elementary Proofs of Relatively Recent Characterizations of
Eulerian Graphs.
Discrete Appl. Math. 24 (1989), 115-119.
|
|
[46]
| With E. Wenger.
D0-Favouring Eulerian Trails in Digraphs.
Arch. Math. (Brno) 25 (1989), 55-60.
|
|
[47]
| With A. J. W. Hilton and B. Jackson.
On the Maximum Number of Pairwise Compatible Euler
Cycles.
J. Graph Theory 14 (1990), 51-63.
|
|
[48]
| With A. Frank.
On Circuit Decomposition of Planar Eulerian Graphs.
Journal of Combinatorial Theory B 50 (1990), 245-253.
|
|
[49]
| With B. Jackson.
Compatible Euler Tours in Digraphs.
in: Cycles and Rays (G. Hahn et al., Eds.),
NATO ASI Ser. C, Kluwer Academic Publishers,
Dordrecht (1990), 95-100.
|
|
[50]
| With E. Wenger.
Characterizing Directed Postman Tours.
in: Topics in Combinatorics and Graph Theory (R.
Bodendiek and R. Henn, Eds.) Physica-Verlag Heidelberg 1990,
257-262.
|
|
[51]
| With M. Fulmek.
P(D)-Compatible Eulerian Trails in Digraphs and a New
Splitting Lemma.
in: Contemporary Methods in Graph Theory (R.
Bodendiek, Ed.), B. I. Wissenschaftverlag 1990, 291-303.
|
|
[52]
| Eulerian Graphs and Related Topics, Part 1, Vol. 1.
Annals of Discrete Mathematics 45, Elsevier Science
Publishers B. V., Amsterdam-New York, 1990.
|
|
[53]
| Eulerian Graphs and Related Topics, Part 1, Vol. 2.
Annals of Discrete Mathematics 50, Elsevier Science
Publishers B. V., Amsterdam-New York, 1991.
|
|
[54]
| A Maze Search Algorithm which also Produces Eulerian Trails.
in: Advances in Graph Theory (V. R. Kulli, Ed.),
Vishwa International Publications 1991, 195-201.
|
|
[55]
| With G. Sabidussi and E. Wenger.
Transforming Eulerian Trails.
Discrete Math. 109 (1992), 103-116.
|
|
[56]
| With M. Stiebitz.
A Solution to a Colouring Problem of P. Erd{H
|
|
[57]
| Spanning Eulerian Subgraphs, The Splitting Lemma, and Petersen's
Theorem.
Discrete Math. 101 (1992), 33-37.
|
|
[58]
| With G. J. Woeginger.
Detecting Cycles through Three Fixed Vertices in a Graph.
Information Processing Letters 41 (1992), 29-33.
|
|
[59]
| With P. Horák and J. Sirán.
Generating Hamiltonian Cycles in Complete Graphs.
Acta Math. Univ. Comenianae 62 (1993), 155-159.
|
|
[60]
| Uniqueness of Maximal Dominating Cycles in 3-regular Graphs and of
Hamiltonian Cycles in 4-regular Graphs.
Journal of Graph Theory 18 (1994), 449-459.
|
|
[61]
| With L. D. Andersen.
The NP-Completeness of Finding A-trails in
Eulerian Graphs and of finding Spanning Trees in Hypergraphs.
Discrete Appl. Math. 59 (1995), 203-214.
|
|
[62]
| With M. Cai.
An Eulerian Trail Traversing Specified Edges in Given
Order.
Journal of Graph Theory 19 (1995), 137-144.
|
|
[63]
| Equalizing Graphs.
unpublished.
|
|
[64]
| A Numbering of the Vertices of Special Networks.
Discrete Math. 165/166 (1997), 263-276.
|
|
[65]
| With M. Stiebitz.
Some remarks on the cycle plus triangles problem.
in: The Mathematics of Paul Erd{Hos, vol. II,
Algorithms Combin. 14, Springer, Berlin, 1997, 136-142
|
|
[66]
| With W.R. Johnstone and A.J.W. Hilton.
r-regular, r-connected decompositions of complete graphs.
J. of Comb. Designs 8; 15-21, 2000.
|
|
[67]
| With L. D. Andersen and S. Regner.
Algorithms and Outerplanar Conditions for A-Trails in
Plane Eulerian Graphs.
Discrete Applied Mathematics 85 (1998), 99-112.
|
|
[68]
| Bipartizing Matchings and Sabidussi's Compatibility Conjecture.
Discrete Mathematics 244 (2002), 77-82.
|
|
[69]
| Traversing graphs: The Eulerian and Hamiltonian Theme.
in ARC ROUTING: Theory, Solutions, and
Applications (ed. M. Dror), pp.19-87, Kluwer Academic Publishers,
2000.
|
|
[70]
| With S. Szeider.
Polynomial-time recognition of minimal unsatisfiable formulas with
fixed clause-variable difference.
Electronic Colloquium on Computational Complexity
(ECCC), TR-00-049, 2000.
|
|
[71]
| With O. Kullmann and S. Szeider.
Polynomial-time recognition of minimal unsatisfiable formulas with
fixed clause-variable difference.
to appear in Theoretical Computer Science.
|
|
[72]
| With S. Földes and S. Szeider.
Remarks on the Concept of Robust Algorithm.
RUTCOR Research. Report RRR-26-2001,
April 2001.
|
|
[73]
| With S. Szeider.
The Connectedness of CNF-Formulas.
Preprint.
|
|
[74]
| With M. Kochol.
A Note About the Dominating Cycle Conjecture.
to appear in Discrete Mathematics.
|
|
[75]
| (Some of) The Many Uses of Eulerian Graphs in Graph Theory
(plus Some Applications).
Discrete Mathematics 230 (2001) 23-43.
|
|
[76]
| With G. Sabidussi.
3-Colourability of 4-regular hamiltonian graphs.
to appear in Journal of Graph Theory.
|
|
[77]
| With P. Horak and R. A. L. Aldred.
Completing Latin squares: critical sets.
Submitted to Journal of Combinatorial Designs.
|
|
[78]
| With R. R. Molina, K. W. Smith, and D. B. West.
A Proof of the Two-Path Conjecture.
Electronic Journal of Combinatorics 9(1), 2002, N4.
|
|
[79]
| With S. Szeider.
On Edge-Colored Graphs Covered by Property Colored
Cycles.
submitted.
|
|
[80]
| With M. Kochol.
Polynomial-Time Recognition of 3-Colorability of Planar
Locally Connected Graphs.
Preprint.
|
|
[81]
| With A. M. Hobbs and M. Muzheve.
Hamiltonian Cycles in Edge-Hexagonal Extensions of Planar
Cubic Graphs.
Preprint.
|
|
[82]
| With A. M. Hobbs and M. Muzheve.
Hamiltonian Cycles in Vertex-Hexagonal Extensions of
Planar Graphs.
Preprint.
|
|
[83]
| A Tutte-Type Characterization of 1-Extendable Graphs.
Preprint.
|
|
[84]
| With R. Häggkvist.
Cycle Double Covers in Special Classes of Graphs.
in preparation.
|
|
[85]
| With G. Sabidussi and V. Sarvanov.
On lower Bounds of Maximum Independent Sets in Special
Types of 4-Regular Graphs.
in preparation.
|
|
[86]
| With V. Sarvanov.
On the Size of Maximum Independent Sets in Special
Types of 4-Regular Graphs.
in preparation.
|