Herbert Fleischner

55 papers Journal 49Unranked 4

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