Herbert Fleischner

Publication Activity (10 Years)

Years Active: 1973-2024
Publications (10 Years): 15

Top Topics

Graph Construction

Graph Theoretic

Introduce A General Framework

Top Venues

J. Graph Theory

Discret. Appl. Math.

J. Comb. Theory, Ser. B

Publications

Jan Ekstein, Herbert Fleischner
The most general structure of graphs with hamiltonian or hamiltonian connected square. Discret. Math. 347 (1) (2024)
Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi
On Finding Hamiltonian Cycles in Barnette Graphs. Fundam. Informaticae 188 (1) (2022)
Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture. J. Graph Theory 96 (2) (2021)
Jan Ekstein, Herbert Fleischner
A best possible result for the square of a 2-block to be hamiltonian. Discret. Math. 344 (1) (2021)
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
A model for finding transition-minors. Discret. Appl. Math. 283 (2020)
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three. Appl. Math. Comput. 380 (2020)
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
A SAT Approach for Finding Sup-Transition-Minors. LION (2019)
Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang
-transition minor. J. Comb. Theory, Ser. B 137 (2019)
Herbert Fleischner, Roland Häggkvist, Arthur Hoffmann-Ostenhof
Cycle double covers via Kotzig graphs. J. Comb. Theory, Ser. B 135 (2019)
Herbert Fleischner
Reducing an arbitrary fullerene to the dodecahedron. Discret. Math. 340 (11) (2017)
Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang
-minor-free graphs. Electron. Notes Discret. Math. 61 (2017)
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Finding Smooth Graphs with Small Independence Numbers. MOD (2017)
Ping Li, Hao Li, Ye Chen, Herbert Fleischner, Hong-Jian Lai
Supereulerian graphs with width s and s-collapsible graphs. Discret. Appl. Math. 200 (2016)
Benedikt Klocker, Herbert Fleischner, Günther R. Raidl
Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. HM (2016)
Herbert Fleischner, Roland Häggkvist
Cycle double covers containing certain circuits in cubic graphs having special structures. Discret. Math. 338 (10) (2015)
Herbert Fleischner, Roland Häggkvist
Cycle Double Covers in Cubic Graphs having Special Structures. J. Graph Theory 77 (2) (2014)
Herbert Fleischner
Uniquely Hamiltonian Graphs of Minimum Degree 4. J. Graph Theory 75 (2) (2014)
Herbert Fleischner, Gert Sabidussi, Vladimir I. Sarvanov
Maximum independent sets in 3- and 4-regular Hamiltonian graphs. Discret. Math. 310 (20) (2010)
Herbert Fleischner, Roland Häggkvist
Circuit double covers in special types of cubic graphs. Discret. Math. 309 (18) (2009)
Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider
Covering graphs with few complete bipartite subgraphs. Theor. Comput. Sci. 410 (21-23) (2009)
Herbert Fleischner, Arthur M. Hobbs, Michael Tapfuma Muzheve
Hamiltonicity in vertex envelopes of plane cubic graphs. Discret. Math. 309 (14) (2009)
Herbert Fleischner, François Genest, Bill Jackson
Compatible circuit decompositions of 4-regular graphs. J. Graph Theory 56 (3) (2007)
Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider
Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS (2007)
Herbert Fleischner, Stefan Szeider
On Edge-Colored Graphs Covered by Properly Colored Cycles. Graphs Comb. 21 (3) (2005)
Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger
Colorability of Planar Graphs with Isolated Nontriangular Faces. Graphs Comb. 20 (4) (2004)
Herbert Fleischner, Gert Sabidussi
3-colorability of 4-regular hamiltonian graphs. J. Graph Theory 42 (2) (2003)
Herbert Fleischner, Martin Kochol
A note about the dominating circuit conjecture. Discret. Math. 259 (1-3) (2002)
Herbert Fleischner
Bipartizing matchings and Sabidussi's compatibility conjecture. Discret. Math. 244 (1-3) (2002)
Herbert Fleischner, Robert R. Molina, Ken W. Smith, Douglas B. West
A Proof of the Two-path Conjecture. Electron. J. Comb. 9 (1) (2002)
Herbert Fleischner, Oliver Kullmann, Stefan Szeider
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theor. Comput. Sci. 289 (1) (2002)
Herbert Fleischner
(Some of) the many uses of Eulerian graphs in graph theory (plus some applications). Discret. Math. 230 (1-3) (2001)
Herbert Fleischner, Stefan Szeider
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference Electron. Colloquium Comput. Complex. 7 (49) (2000)
Lars Døvling Andersen, Herbert Fleischner, Susanne Regner
Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian Graphs. Discret. Appl. Math. 85 (2) (1998)
Herbert Fleischner
A numbering of the vertices of special networks. Discret. Math. (1997)
Lars Døvling Andersen, Herbert Fleischner
The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs. Discret. Appl. Math. 59 (3) (1995)
Mao-cheng Cai, Herbert Fleischner
An eulerian trail traversing specified edges in given order. J. Graph Theory 19 (2) (1995)
Herbert Fleischner
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs. J. Graph Theory 18 (5) (1994)
Herbert Fleischner, Gert Sabidussi, Emanuel Wenger
Transforming eulerian trails. Discret. Math. 109 (1-3) (1992)
Herbert Fleischner, Gerhard J. Woeginger
Detecting Cycles Through Three Fixed Vertices in a Graph. Inf. Process. Lett. 42 (1) (1992)
Herbert Fleischner, Michael Stiebitz
A solution to a colouring problem of P. Erdös. Discret. Math. 101 (1-3) (1992)
Herbert Fleischner
Spanning eularian subgraphs, the splitting Lemma, and Petersen's theorem. Discret. Math. 101 (1-3) (1992)
Herbert Fleischner, András Frank
On circuit decomposition of planar Eulerian graphs. J. Comb. Theory, Ser. B 50 (2) (1990)
Herbert Fleischner, Anthony J. W. Hilton, Bill Jackson
On the maximum number of pairwise compatible euler cycles. J. Graph Theory 14 (1) (1990)
Herbert Fleischner
Elementary proofs of (relatively) recent characterizations of Eulerian graphs. Discret. Appl. Math. 24 (1-3) (1989)
Lars Døvling Andersen, Herbert Fleischner, Bill Jackson
Removable edges in cyclically 4-edge-connected cubic graphs. Graphs Comb. 4 (1) (1988)
Herbert Fleischner, Bill Jackson
Compatible path-cycle-decompositions of plane graphs. J. Comb. Theory, Ser. B 42 (1) (1987)
Herbert Fleischner
Proof of the strong 2-Cover Conjecture for planar graphs. J. Comb. Theory, Ser. B 40 (2) (1986)
Herbert Fleischner
Even cycles with prescribed chords in planar cubic graphs. Discret. Math. 44 (3) (1983)
Herbert Fleischner
Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeiden. J. Comb. Theory, Ser. B 29 (2) (1980)
Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen
Three-regular subgraphs of four-regular graphs. J. Graph Theory 3 (4) (1979)
Herbert Fleischner
On the Equivalence of Mealy-Type and Moore-Type Automata and a Relation between Reducibility and Moore-Reducibility. J. Comput. Syst. Sci. 14 (1) (1977)
Herbert Fleischner
The uniquely embeddable planar graphs. Discret. Math. 4 (4) (1973)