Herbert Fleischner

According to our database, Herbert Fleischner authored at least 53 papers between 1973 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

The most general structure of graphs with hamiltonian or hamiltonian connected square.

Jan Ekstein, Herbert Fleischner

Discret. Math., January, 2024

2022

On Finding Hamiltonian Cycles in Barnette Graphs.

Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi

Fundam. Informaticae, 2022

2021

Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture.

Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi

J. Graph Theory, 2021

A best possible result for the square of a 2-block to be hamiltonian.

Jan Ekstein, Herbert Fleischner

Discret. Math., 2021

2020

A model for finding transition-minors.

Benedikt Klocker, Herbert Fleischner, Günther R. Raidl

Discret. Appl. Math., 2020

A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three.

Benedikt Klocker, Herbert Fleischner, Günther R. Raidl

Appl. Math. Comput., 2020

2019

Cycle double covers via Kotzig graphs.

Herbert Fleischner, Roland Häggkvist, Arthur Hoffmann-Ostenhof

J. Comb. Theory, Ser. B, 2019

Cycle covers (III) - Compatible circuit decomposition and <i>K</i>₅-transition minor.

Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang

J. Comb. Theory, Ser. B, 2019

A SAT Approach for Finding Sup-Transition-Minors.

Benedikt Klocker, Herbert Fleischner, Günther R. Raidl

Proceedings of the Learning and Intelligent Optimization - 13th International Conference, 2019

2017

Compatible Cycle Decomposition of bad K₅-minor-free graphs.

Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang

Electron. Notes Discret. Math., 2017

Reducing an arbitrary fullerene to the dodecahedron.

Herbert Fleischner

Discret. Math., 2017

Finding Smooth Graphs with Small Independence Numbers.

Benedikt Klocker, Herbert Fleischner, Günther R. Raidl

Proceedings of the Machine Learning, Optimization, and Big Data, 2017

2016

Supereulerian graphs with width s and s-collapsible graphs.

Ping Li, Hao Li, Ye Chen, Herbert Fleischner, Hong-Jian Lai

Discret. Appl. Math., 2016

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers.

Benedikt Klocker, Herbert Fleischner, Günther R. Raidl

Proceedings of the Hybrid Metaheuristics - 10th International Workshop, 2016

2015

Cycle double covers containing certain circuits in cubic graphs having special structures.

Herbert Fleischner, Roland Häggkvist

Discret. Math., 2015

2014

Cycle Double Covers in Cubic Graphs having Special Structures.

Herbert Fleischner, Roland Häggkvist

J. Graph Theory, 2014

Uniquely Hamiltonian Graphs of Minimum Degree 4.

Herbert Fleischner

J. Graph Theory, 2014

2013

Some Remarks on the Cycle Plus Triangles Problem.

Herbert Fleischner, Michael Stiebitz

Proceedings of the Mathematics of Paul Erdős II, 2013

2010

Maximum independent sets in 3- and 4-regular Hamiltonian graphs.

Herbert Fleischner, Gert Sabidussi, Vladimir I. Sarvanov

Discret. Math., 2010

2009

Covering graphs with few complete bipartite subgraphs.

Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider

Theor. Comput. Sci., 2009

Hamiltonicity in vertex envelopes of plane cubic graphs.

Herbert Fleischner, Arthur M. Hobbs, Michael Tapfuma Muzheve

Discret. Math., 2009

Circuit double covers in special types of cubic graphs.

Herbert Fleischner, Roland Häggkvist

Discret. Math., 2009

2007

Compatible circuit decompositions of 4-regular graphs.

Herbert Fleischner, François Genest, Bill Jackson

J. Graph Theory, 2007

2005

On Edge-Colored Graphs Covered by Properly Colored Cycles.

Herbert Fleischner, Stefan Szeider

Graphs Comb., 2005

2004

Colorability of Planar Graphs with Isolated Nontriangular Faces.

Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger

Graphs Comb., 2004

2003

3-colorability of 4-regular hamiltonian graphs.

Herbert Fleischner, Gert Sabidussi

J. Graph Theory, 2003

Connectivity and Traversability.

Josep Fàbrega, Miguel Angel Fiol, Herbert Fleischner, R. Gary Parker, A Dewdney, Ronald J. Gould, Gregory Z. Gutin

Proceedings of the Handbook of Graph Theory., 2003

2002

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.

Herbert Fleischner, Oliver Kullmann, Stefan Szeider

Theor. Comput. Sci., 2002

A note about the dominating circuit conjecture.

Herbert Fleischner, Martin Kochol

Discret. Math., 2002

Bipartizing matchings and Sabidussi's compatibility conjecture.

Herbert Fleischner

Discret. Math., 2002

A Proof of the Two-path Conjecture.

Herbert Fleischner, Robert R. Molina, Ken W. Smith, Douglas B. West

Electron. J. Comb., 2002

2001

(Some of) the many uses of Eulerian graphs in graph theory (plus some applications).

Herbert Fleischner

Discret. Math., 2001

2000

Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference

Herbert Fleischner, Stefan Szeider

Electron. Colloquium Comput. Complex., 2000

1998

Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian Graphs.

Lars Døvling Andersen, Herbert Fleischner, Susanne Regner

Discret. Appl. Math., 1998

1997

A numbering of the vertices of special networks.

Herbert Fleischner

Discret. Math., 1997

1995

An eulerian trail traversing specified edges in given order.

Mao-cheng Cai, Herbert Fleischner

J. Graph Theory, 1995

The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs.

Lars Døvling Andersen, Herbert Fleischner

Discret. Appl. Math., 1995

1994

Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs.

Herbert Fleischner

J. Graph Theory, 1994

1992

Detecting Cycles Through Three Fixed Vertices in a Graph.

Herbert Fleischner, Gerhard J. Woeginger

Inf. Process. Lett., 1992

Transforming eulerian trails.

Herbert Fleischner, Gert Sabidussi, Emanuel Wenger

Discret. Math., 1992

A solution to a colouring problem of P. Erdös.

Herbert Fleischner, Michael Stiebitz

Discret. Math., 1992

Spanning eularian subgraphs, the splitting Lemma, and Petersen's theorem.

Herbert Fleischner

Discret. Math., 1992

1990

On the maximum number of pairwise compatible euler cycles.

Herbert Fleischner, Anthony J. W. Hilton, Bill Jackson

J. Graph Theory, 1990

On circuit decomposition of planar Eulerian graphs.

Herbert Fleischner, András Frank

J. Comb. Theory, Ser. B, 1990

1989

Elementary proofs of (relatively) recent characterizations of Eulerian graphs.

Herbert Fleischner

Discret. Appl. Math., 1989

1988

Removable edges in cyclically 4-edge-connected cubic graphs.

Lars Døvling Andersen, Herbert Fleischner, Bill Jackson

Graphs Comb., 1988

1987

Compatible path-cycle-decompositions of plane graphs.

Herbert Fleischner, Bill Jackson

J. Comb. Theory, Ser. B, 1987

1986

Proof of the strong 2-Cover Conjecture for planar graphs.

Herbert Fleischner

J. Comb. Theory, Ser. B, 1986

1983

Even cycles with prescribed chords in planar cubic graphs.

Herbert Fleischner

Discret. Math., 1983

1980

Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeiden.

Herbert Fleischner

J. Comb. Theory, Ser. B, 1980

1979

Three-regular subgraphs of four-regular graphs.

Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen

J. Graph Theory, 1979

1977

On the Equivalence of Mealy-Type and Moore-Type Automata and a Relation between Reducibility and Moore-Reducibility.

Herbert Fleischner

J. Comput. Syst. Sci., 1977

1973

The uniquely embeddable planar graphs.

Herbert Fleischner

Discret. Math., 1973