Herbert Fleischner

According to our database1, Herbert Fleischner authored at least 46 papers between 1973 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Cycle double covers via Kotzig graphs.
J. Comb. Theory, Ser. B, 2019

Cycle covers (III) - Compatible circuit decomposition and K5-transition minor.
J. Comb. Theory, Ser. B, 2019

2017
Compatible Cycle Decomposition of bad K5-minor-free graphs.
Electronic Notes in Discrete Mathematics, 2017

Reducing an arbitrary fullerene to the dodecahedron.
Discrete Mathematics, 2017

Finding Smooth Graphs with Small Independence Numbers.
Proceedings of the Machine Learning, Optimization, and Big Data, 2017

2016
Supereulerian graphs with width s and s-collapsible graphs.
Discrete Applied Mathematics, 2016

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers.
Proceedings of the Hybrid Metaheuristics - 10th International Workshop, 2016

2015
Cycle double covers containing certain circuits in cubic graphs having special structures.
Discrete Mathematics, 2015

2014
Cycle Double Covers in Cubic Graphs having Special Structures.
Journal of Graph Theory, 2014

Uniquely Hamiltonian Graphs of Minimum Degree 4.
Journal of Graph Theory, 2014

2013
Some Remarks on the Cycle Plus Triangles Problem.
Proceedings of the Mathematics of Paul Erdős II, 2013

2010
Maximum independent sets in 3- and 4-regular Hamiltonian graphs.
Discrete Mathematics, 2010

2009
Covering graphs with few complete bipartite subgraphs.
Theor. Comput. Sci., 2009

Hamiltonicity in vertex envelopes of plane cubic graphs.
Discrete Mathematics, 2009

Circuit double covers in special types of cubic graphs.
Discrete Mathematics, 2009

2007
Compatible circuit decompositions of 4-regular graphs.
Journal of Graph Theory, 2007

Covering Graphs with Few Complete Bipartite Subgraphs.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2005
On Edge-Colored Graphs Covered by Properly Colored Cycles.
Graphs and Combinatorics, 2005

2004
Colorability of Planar Graphs with Isolated Nontriangular Faces.
Graphs and Combinatorics, 2004

2003
3-colorability of 4-regular hamiltonian graphs.
Journal of Graph Theory, 2003

2002
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
Theor. Comput. Sci., 2002

A note about the dominating circuit conjecture.
Discrete Mathematics, 2002

Bipartizing matchings and Sabidussi's compatibility conjecture.
Discrete Mathematics, 2002

A Proof of the Two-path Conjecture.
Electr. J. Comb., 2002

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

2000
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference
Electronic Colloquium on Computational Complexity (ECCC), 2000

1998
Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian Graphs.
Discrete Applied Mathematics, 1998

1997
A numbering of the vertices of special networks.
Discrete Mathematics, 1997

1995
An eulerian trail traversing specified edges in given order.
Journal of Graph Theory, 1995

The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs.
Discrete Applied Mathematics, 1995

1994
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs.
Journal of Graph Theory, 1994

1992
Detecting Cycles Through Three Fixed Vertices in a Graph.
Inf. Process. Lett., 1992

Transforming eulerian trails.
Discrete Mathematics, 1992

A solution to a colouring problem of P. Erdös.
Discrete Mathematics, 1992

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

1990
On the maximum number of pairwise compatible euler cycles.
Journal of Graph Theory, 1990

On circuit decomposition of planar Eulerian graphs.
J. Comb. Theory, Ser. B, 1990

1989
Elementary proofs of (relatively) recent characterizations of Eulerian graphs.
Discrete Applied Mathematics, 1989

1988
Removable edges in cyclically 4-edge-connected cubic graphs.
Graphs and Combinatorics, 1988

1987
Compatible path-cycle-decompositions of plane graphs.
J. Comb. Theory, Ser. B, 1987

1986
Proof of the strong 2-Cover Conjecture for planar graphs.
J. Comb. Theory, Ser. B, 1986

1983
Even cycles with prescribed chords in planar cubic graphs.
Discrete Mathematics, 1983

1980
Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeiden.
J. Comb. Theory, Ser. B, 1980

1979
Three-regular subgraphs of four-regular graphs.
Journal of Graph Theory, 1979

1977
On the Equivalence of Mealy-Type and Moore-Type Automata and a Relation between Reducibility and Moore-Reducibility.
J. Comput. Syst. Sci., 1977

1973
The uniquely embeddable planar graphs.
Discrete Mathematics, 1973


  Loading...