| Publication | Date of Publication | Type |
|---|
Perfect pseudo-matchings in cubic graphs
Graphs and Combinatorics | 2024-11-20 | Paper |
Obituary: Gert Sabidussi 1929--2022
Internationale Mathematische Nachrichten | 2024-10-22 | Paper |
The most general structure of graphs with Hamiltonian or Hamiltonian connected square
Discrete Mathematics | 2023-10-30 | Paper |
Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture
Journal of Graph Theory | 2023-09-29 | Paper |
On Finding Hamiltonian Cycles in Barnette Graphs
Fundamenta Informaticae | 2023-03-09 | Paper |
On finding hamiltonian cycles in Barnette graphs
(available as arXiv preprint) | 2022-12-05 | Paper |
A best possible result for the square of a 2-block to be Hamiltonian
Discrete Mathematics | 2021-01-21 | Paper |
A best possible result for the square of a 2-block to be Hamiltonian
Discrete Mathematics | 2021-01-21 | Paper |
A model for finding transition-minors
Discrete Applied Mathematics | 2020-06-29 | Paper |
A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three
Applied Mathematics and Computation | 2020-05-14 | Paper |
Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor
Journal of Combinatorial Theory. Series B | 2019-07-17 | Paper |
| Perfect Pseudo-Matchings in cubic graphs | 2019-05-11 | Paper |
Cycle double covers via kotzig graphs
Journal of Combinatorial Theory. Series B | 2019-02-08 | Paper |
Revisiting the Hamiltonian theme in the square of a block: the general case
Journal of Combinatorics | 2018-12-10 | Paper |
| On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs | 2018-06-15 | Paper |
| Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture | 2018-06-14 | Paper |
| Compatible cycle decomposition of bad \(K_5\)-minor-free graphs | 2018-01-18 | Paper |
Revisiting the Hamiltonian theme in the square of a block: the case of \(DT\)-graphs
Journal of Combinatorics | 2018-01-15 | Paper |
| scientific article; zbMATH DE number 6785599 (Why is no real title available?) | 2017-10-04 | Paper |
Reducing an arbitrary fullerene to the dodecahedron
Discrete Mathematics | 2017-09-05 | Paper |
Ralph Faudree (1938--2015)
Discrete Mathematics | 2016-04-27 | Paper |
Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs
Discrete Applied Mathematics | 2016-01-21 | Paper |
Cycle double covers containing certain circuits in cubic graphs having special structures
Discrete Mathematics | 2015-06-01 | Paper |
Cycle double covers in cubic graphs having special structures
Journal of Graph Theory | 2014-10-09 | Paper |
Uniquely Hamiltonian graphs of minimum degree 4
Journal of Graph Theory | 2014-01-28 | Paper |
Maximum independent sets in 3- and 4-regular Hamiltonian graphs
Discrete Mathematics | 2010-10-18 | Paper |
Circuit double covers in special types of cubic graphs
Discrete Mathematics | 2009-12-15 | Paper |
Hamiltonicity in vertex envelopes of plane cubic graphs
Discrete Mathematics | 2009-12-15 | Paper |
Covering graphs with few complete bipartite subgraphs
Theoretical Computer Science | 2009-05-28 | Paper |
Covering Graphs with Few Complete Bipartite Subgraphs
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Compatible circuit decompositions of 4‐regular graphs
Journal of Graph Theory | 2008-01-04 | Paper |
On edge-colored graphs covered by properly colored cycles
Graphs and Combinatorics | 2005-11-24 | Paper |
Colorability of planar graphs with isolated nontriangular faces
Graphs and Combinatorics | 2005-01-20 | Paper |
Completing Latin squares: Critical sets
Journal of Combinatorial Designs | 2003-03-19 | Paper |
A note about the dominating circuit conjecture
Discrete Mathematics | 2003-03-16 | Paper |
3-colorability of 4-regular hamiltonian graphs
Journal of Graph Theory | 2003-03-10 | Paper |
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
Theoretical Computer Science | 2003-01-21 | Paper |
Bipartizing matchings and Sabidussi's compatibility conjecture
Discrete Mathematics | 2002-05-21 | Paper |
A proof of the two-path conjecture
The Electronic Journal of Combinatorics | 2002-04-25 | Paper |
A proof of the two-path conjecture
The Electronic Journal of Combinatorics | 2002-04-25 | Paper |
(Some of) the many uses of Eulerian graphs in graph theory (plus some applications)
Discrete Mathematics | 2002-01-17 | Paper |
| scientific article; zbMATH DE number 1568936 (Why is no real title available?) | 2001-10-14 | Paper |
| r-Regular, r-connected decompositions of complete graphs | 2000-01-30 | Paper |
Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs
Discrete Applied Mathematics | 1998-07-28 | Paper |
A numbering of the vertices of special networks
Discrete Mathematics | 1997-10-07 | Paper |
| scientific article; zbMATH DE number 970801 (Why is no real title available?) | 1997-03-11 | Paper |
An eulerian trail traversing specified edges in given order
Journal of Graph Theory | 1996-11-27 | Paper |
| scientific article; zbMATH DE number 772748 (Why is no real title available?) | 1995-07-12 | Paper |
| scientific article; zbMATH DE number 772748 (Why is no real title available?) | 1995-07-12 | Paper |
The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs
Discrete Applied Mathematics | 1995-07-03 | Paper |
Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs
Journal of Graph Theory | 1995-03-02 | Paper |
Transforming eulerian trails
Discrete Mathematics | 1993-10-14 | Paper |
Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
Discrete Mathematics | 1993-01-16 | Paper |
A solution to a colouring problem of P. Erdős
Discrete Mathematics | 1993-01-16 | Paper |
Detecting cycles through three fixed vertices in a graph
Information Processing Letters | 1993-01-16 | Paper |
Eulerian graphs and related topics. Part 1, Volume 2
Annals of Discrete Mathematics | 1992-09-17 | Paper |
Eulerian graphs and related topics. Part 1, Volume 1
Annals of Discrete Mathematics | 1992-09-17 | Paper |
| scientific article; zbMATH DE number 15460 (Why is no real title available?) | 1992-06-25 | Paper |
On circuit decomposition of planar Eulerian graphs
Journal of Combinatorial Theory. Series B | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 15867 (Why is no real title available?) | 1992-06-25 | Paper |
On the maximum number of pairwise compatible euler cycles
Journal of Graph Theory | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4142070 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4108816 (Why is no real title available?) | 1989-01-01 | Paper |
Elementary proofs of (relatively) recent characterizations of Eulerian graphs
Discrete Applied Mathematics | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4162907 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4087694 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4106897 (Why is no real title available?) | 1988-01-01 | Paper |
Removable edges in cyclically 4-edge-connected cubic graphs
Graphs and Combinatorics | 1988-01-01 | Paper |
Compatible path-cycle-decompositions of plane graphs
Journal of Combinatorial Theory. Series B | 1987-01-01 | Paper |
Proof of the strong 2-cover conjecture for planar graphs
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3966112 (Why is no real title available?) | 1985-01-01 | Paper |
Removable Cycles in Planar Graphs
Journal of the London Mathematical Society | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3885954 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3825852 (Why is no real title available?) | 1983-01-01 | Paper |
Even cycles with prescribed chords in planar cubic graphs
Discrete Mathematics | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3851137 (Why is no real title available?) | 1983-01-01 | Paper |
Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
Journal of Combinatorial Theory. Series B | 1980-01-01 | Paper |
Three‐regular subgraphs of four‐regular graphs
Journal of Graph Theory | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3655994 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3659617 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3685520 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3784797 (Why is no real title available?) | 1979-01-01 | Paper |
Value-true walks in finite, connected, valuated graphs
Monatshefte für Mathematik | 1977-01-01 | Paper |
On the equivalence of Mealy-type and Moore-type automata and a relation between reducibility and Moore-reducibility
Journal of Computer and System Sciences | 1977-01-01 | Paper |
In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts
Monatshefte für Mathematik | 1976-01-01 | Paper |
Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
Monatshefte für Mathematik | 1976-01-01 | Paper |
Hamiltonian Cycles in Squares of Vertex-Unicyclic Graphs
Canadian Mathematical Bulletin | 1976-01-01 | Paper |
Gedanken zur Vier-Farben-Vermutung
Monatshefte für Mathematik | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3547322 (Why is no real title available?) | 1975-01-01 | Paper |
Hamiltonian Total Graphs
Mathematische Nachrichten | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3508546 (Why is no real title available?) | 1975-01-01 | Paper |
A necessary condition for the square of a graph to be Hamiltonian
Journal of Combinatorial Theory. Series B | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3506733 (Why is no real title available?) | 1975-01-01 | Paper |
HAMILTONsche totale Graphen von ebenen Graphen
Mathematische Nachrichten | 1975-01-01 | Paper |
On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
Journal of Combinatorial Theory. Series B | 1974-01-01 | Paper |
The square of every two-connected graph is Hamiltonian
Journal of Combinatorial Theory. Series B | 1974-01-01 | Paper |
Distribution of points of odd degree of certain triangulations in the plane
Monatshefte für Mathematik | 1974-01-01 | Paper |
The importance of being Euler
Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg | 1974-01-01 | Paper |
On Regulating Sets and the Disparity of Planar Cubic Graphs
Canadian Mathematical Bulletin | 1974-01-01 | Paper |
Die Bestimmung der kubischen Graphen mit Hamiltonschem Quadrat
Mathematische Nachrichten | 1973-01-01 | Paper |
Die Bestimmung der kubischen Graphen mit Hamiltonschem Quadrat
Mathematische Nachrichten | 1973-01-01 | Paper |
The uniquely embeddable planar graphs
Discrete Mathematics | 1973-01-01 | Paper |
Hamiltonsche Linien im Quadrat brückenloser Graphen mit Artikulationen
Monatshefte für Mathematik | 1972-01-01 | Paper |
| scientific article; zbMATH DE number 3355061 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3355061 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3355062 (Why is no real title available?) | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3355062 (Why is no real title available?) | 1971-01-01 | Paper |
The square of every nonseparable graph is Hamiltonian
Bulletin of the American Mathematical Society | 1971-01-01 | Paper |
Über HAMILTONsche Linien im Quadrat kubischer und pseudokubischer Graphen
Mathematische Nachrichten | 1971-01-01 | Paper |
Über endliche, ebene Eulersche und paare, kubische Graphen
Monatshefte für Mathematik | 1970-01-01 | Paper |
