Herbert Fleischner

From MaRDI portal
Person:241266

Available identifiers

zbMath Open fleischner.herbert-jDBLP06/5188WikidataQ28729974 ScholiaQ28729974MaRDI QIDQ241266

List of research outcomes





PublicationDate of PublicationType
Perfect pseudo-matchings in cubic graphs2024-11-20Paper
Obituary: Gert Sabidussi 1929--20222024-10-22Paper
The most general structure of graphs with Hamiltonian or Hamiltonian connected square2023-10-30Paper
Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture2023-09-29Paper
On Finding Hamiltonian Cycles in Barnette Graphs2023-03-09Paper
On finding hamiltonian cycles in Barnette graphs2022-12-05Paper
A best possible result for the square of a 2-block to be Hamiltonian2021-01-21Paper
A model for finding transition-minors2020-06-29Paper
A lower bound for the smallest uniquely Hamiltonian planar graph with minimum degree three2020-05-14Paper
Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor2019-07-17Paper
Perfect Pseudo-Matchings in cubic graphs2019-05-11Paper
Cycle double covers via kotzig graphs2019-02-08Paper
Revisiting the Hamiltonian theme in the square of a block: the general case2018-12-10Paper
On the algorithmic complexity of finding hamiltonian cycles in special classes of planar cubic graphs2018-06-15Paper
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture2018-06-14Paper
Compatible cycle decomposition of bad \(K_5\)-minor-free graphs2018-01-18Paper
Revisiting the Hamiltonian theme in the square of a block: the case of \(DT\)-graphs2018-01-15Paper
https://portal.mardi4nfdi.de/entity/Q53643472017-10-04Paper
Reducing an arbitrary fullerene to the dodecahedron2017-09-05Paper
Ralph Faudree (1938--2015)2016-04-27Paper
Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs2016-01-21Paper
Cycle double covers containing certain circuits in cubic graphs having special structures2015-06-01Paper
Cycle double covers in cubic graphs having special structures2014-10-09Paper
Uniquely Hamiltonian graphs of minimum degree 42014-01-28Paper
Maximum independent sets in 3- and 4-regular Hamiltonian graphs2010-10-18Paper
Circuit double covers in special types of cubic graphs2009-12-15Paper
Hamiltonicity in vertex envelopes of plane cubic graphs2009-12-15Paper
Covering graphs with few complete bipartite subgraphs2009-05-28Paper
Covering Graphs with Few Complete Bipartite Subgraphs2008-04-24Paper
Compatible circuit decompositions of 4‐regular graphs2008-01-04Paper
On edge-colored graphs covered by properly colored cycles2005-11-24Paper
Colorability of planar graphs with isolated nontriangular faces2005-01-20Paper
Completing Latin squares: Critical sets2003-03-19Paper
A note about the dominating circuit conjecture2003-03-16Paper
3-colorability of 4-regular hamiltonian graphs2003-03-10Paper
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.2003-01-21Paper
Bipartizing matchings and Sabidussi's compatibility conjecture2002-05-21Paper
A proof of the two-path conjecture2002-04-25Paper
(Some of) the many uses of Eulerian graphs in graph theory (plus some applications)2002-01-17Paper
https://portal.mardi4nfdi.de/entity/Q47624632001-10-14Paper
r-Regular, r-connected decompositions of complete graphs2000-01-30Paper
Algorithms and outerplanar conditions for \(A\)-trails in plane Eulerian graphs1998-07-28Paper
A numbering of the vertices of special networks1997-10-07Paper
https://portal.mardi4nfdi.de/entity/Q56890061997-03-11Paper
An eulerian trail traversing specified edges in given order1996-11-27Paper
https://portal.mardi4nfdi.de/entity/Q48384541995-07-12Paper
The NP-completeness of finding A-trails in Eulerian graphs and of finding spanning trees in hypergraphs1995-07-03Paper
Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs1995-03-02Paper
Transforming eulerian trails1993-10-14Paper
Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem1993-01-16Paper
A solution to a colouring problem of P. Erdős1993-01-16Paper
Detecting cycles through three fixed vertices in a graph1993-01-16Paper
Eulerian graphs and related topics. Part 1, Volume 21992-09-17Paper
Eulerian graphs and related topics. Part 1, Volume 11992-09-17Paper
https://portal.mardi4nfdi.de/entity/Q39720981992-06-25Paper
On circuit decomposition of planar Eulerian graphs1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39725171992-06-25Paper
On the maximum number of pairwise compatible euler cycles1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746681990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38326071989-01-01Paper
Elementary proofs of (relatively) recent characterizations of Eulerian graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34900171989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38160941989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38310451988-01-01Paper
Removable edges in cyclically 4-edge-connected cubic graphs1988-01-01Paper
Compatible path-cycle-decompositions of plane graphs1987-01-01Paper
Proof of the strong 2-cover conjecture for planar graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37344351985-01-01Paper
Removable Cycles in Planar Graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32206291984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36720161983-01-01Paper
Even cycles with prescribed chords in planar cubic graphs1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33204191983-01-01Paper
Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden1980-01-01Paper
Three‐regular subgraphs of four‐regular graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38552231979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38582871979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38808671979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39629271979-01-01Paper
Value-true walks in finite, connected, valuated graphs1977-01-01Paper
On the equivalence of Mealy-type and Moore-type automata and a relation between reducibility and Moore-reducibility1977-01-01Paper
In the square of graphs, Hamiltonicity and pancyclicity, Hamiltonian connectedness and panconnectedness are equivalent concepts1976-01-01Paper
Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen1976-01-01Paper
Hamiltonian Cycles in Squares of Vertex-Unicyclic Graphs1976-01-01Paper
Gedanken zur Vier-Farben-Vermutung1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41219211975-01-01Paper
Hamiltonian Total Graphs1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40888571975-01-01Paper
A necessary condition for the square of a graph to be Hamiltonian1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40872151975-01-01Paper
HAMILTONsche totale Graphen von ebenen Graphen1975-01-01Paper
On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs1974-01-01Paper
The square of every two-connected graph is Hamiltonian1974-01-01Paper
Distribution of points of odd degree of certain triangulations in the plane1974-01-01Paper
The importance of being Euler1974-01-01Paper
On Regulating Sets and the Disparity of Planar Cubic Graphs1974-01-01Paper
The uniquely embeddable planar graphs1973-01-01Paper
Die Bestimmung der kubischen Graphen mit Hamiltonschem Quadrat1973-01-01Paper
Die Bestimmung der kubischen Graphen mit Hamiltonschem Quadrat1973-01-01Paper
Hamiltonsche Linien im Quadrat brückenloser Graphen mit Artikulationen1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56296551971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56296561971-01-01Paper
The square of every nonseparable graph is Hamiltonian1971-01-01Paper
Über HAMILTONsche Linien im Quadrat kubischer und pseudokubischer Graphen1971-01-01Paper
Über endliche, ebene Eulersche und paare, kubische Graphen1970-01-01Paper

Research outcomes over time

This page was built for person: Herbert Fleischner