Herbert Fleischner - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 54 from 54

2024

The most general structure of graphs with hamiltonian or hamiltonian connected squareJan Ekstein, Herbert Fleischner. DM, 347(1):113702, January 2024. [doi]

2022

On Finding Hamiltonian Cycles in Barnette GraphsBehrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi. FUIN, 188(1):1-14, 2022. [doi]

2021

A best possible result for the square of a 2-block to be hamiltonianJan Ekstein, Herbert Fleischner. DM, 344(1):112158, 2021. [doi]

Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's ConjectureBehrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi. jgt, 96(2):269-288, 2021. [doi]

2020

A model for finding transition-minorsBenedikt Klocker, Herbert Fleischner, Günther R. Raidl. DAM, 283:242-264, 2020. [doi]

A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree threeBenedikt Klocker, Herbert Fleischner, Günther R. Raidl. amc, 380:125233, 2020. [doi]

2019

Cycle double covers via Kotzig graphsHerbert Fleischner, Roland Häggkvist, Arthur Hoffmann-Ostenhof. JCT, 135:212-226, 2019. [doi]

5-transition minorHerbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang. JCT, 137:25-54, 2019. [doi]

A SAT Approach for Finding Sup-Transition-MinorsBenedikt Klocker, Herbert Fleischner, Günther R. Raidl. lion 2020: 325-341 [doi]

2017

Reducing an arbitrary fullerene to the dodecahedronHerbert Fleischner. DM, 340(11):2714-2722, 2017. [doi]

5-minor-free graphsHerbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang. endm, 61:445-449, 2017. [doi]

Finding Smooth Graphs with Small Independence NumbersBenedikt Klocker, Herbert Fleischner, Günther R. Raidl. mod 2018: 527-539 [doi]

2016

Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing NumbersBenedikt Klocker, Herbert Fleischner, Günther R. Raidl. hm 2016: 1-16 [doi]

Supereulerian graphs with width s and s-collapsible graphsPing Li, Hao Li, Ye Chen, Herbert Fleischner, Hong-Jian Lai. DAM, 200:79-94, 2016. [doi]

2015

Cycle double covers containing certain circuits in cubic graphs having special structuresHerbert Fleischner, Roland Häggkvist. DM, 338(10):1750-1754, 2015. [doi]

2014

Cycle Double Covers in Cubic Graphs having Special StructuresHerbert Fleischner, Roland Häggkvist. jgt, 77(2):158-170, 2014. [doi]

Uniquely Hamiltonian Graphs of Minimum Degree 4Herbert Fleischner. jgt, 75(2):167-177, 2014. [doi]

2013

Some Remarks on the Cycle Plus Triangles ProblemHerbert Fleischner, Michael Stiebitz. In Ronald L. Graham, Jaroslav Nesetril, Steve Butler, editors, The Mathematics of Paul Erdős II. pages 119-125, Springer, 2013. [doi]

2010

Maximum independent sets in 3- and 4-regular Hamiltonian graphsHerbert Fleischner, Gert Sabidussi, Vladimir I. Sarvanov. DM, 310(20):2742-2749, 2010. [doi]

2009

Circuit double covers in special types of cubic graphsHerbert Fleischner, Roland Häggkvist. DM, 309(18):5724-5728, 2009. [doi]

Hamiltonicity in vertex envelopes of plane cubic graphsHerbert Fleischner, Arthur M. Hobbs, Michael Tapfuma Muzheve. DM, 309(14):4793-4809, 2009. [doi]

Covering graphs with few complete bipartite subgraphsHerbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider. TCS, 410(21-23):2045-2053, 2009. [doi]

2007

Compatible circuit decompositions of 4-regular graphsHerbert Fleischner, François Genest, Bill Jackson. jgt, 56(3):227-240, 2007. [doi]

Covering Graphs with Few Complete Bipartite SubgraphsHerbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider. fsttcs 2007: 340-351 [doi]

2005

On Edge-Colored Graphs Covered by Properly Colored CyclesHerbert Fleischner, Stefan Szeider. gc, 21(3):301-306, 2005. [doi]

2004

Colorability of Planar Graphs with Isolated Nontriangular FacesMark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger. gc, 20(4):443-446, 2004. [doi]

2003

3-colorability of 4-regular hamiltonian graphsHerbert Fleischner, Gert Sabidussi. jgt, 42(2):125-140, 2003. [doi]

Connectivity and TraversabilityJosep Fàbrega, Miguel Angel Fiol, Herbert Fleischner, R. Gary Parker, A Dewdney, Ronald J. Gould, Gregory Z. Gutin. In Jonathan L. Gross, Jay Yellen, editors, Handbook of Graph Theory. Discrete Mathematics and Its Applications, pages 193-339, Chapman & Hall / Taylor & Francis, 2003. [doi]

2002

Bipartizing matchings and Sabidussi s compatibility conjectureHerbert Fleischner. DM, 244(1-3):77-82, 2002. [doi]

A note about the dominating circuit conjectureHerbert Fleischner, Martin Kochol. DM, 259(1-3):307-309, 2002. [doi]

A Proof of the Two-path ConjectureHerbert Fleischner, Robert R. Molina, Ken W. Smith, Douglas B. West. combinatorics, 9(1), 2002. [doi]

Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable differenceHerbert Fleischner, Oliver Kullmann, Stefan Szeider. TCS, 289(1):503-516, 2002.

2001

(Some of) the many uses of Eulerian graphs in graph theory (plus some applications)Herbert Fleischner. DM, 230(1-3):23-43, 2001. [doi]

2000

Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable DifferenceHerbert Fleischner, Stefan Szeider. eccc, 7(49), 2000. [doi]

1998

Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian GraphsLars Døvling Andersen, Herbert Fleischner, Susanne Regner. DAM, 85(2):99-112, 1998. [doi]

1997

A numbering of the vertices of special networksHerbert Fleischner. DM, 165-166:263-276, 1997. [doi]

1995

The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in HypergraphsLars Døvling Andersen, Herbert Fleischner. DAM, 59(3):203-214, 1995. [doi]

An eulerian trail traversing specified edges in given orderMao-cheng Cai, Herbert Fleischner. jgt, 19(2):137-144, 1995. [doi]

1994

Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphsHerbert Fleischner. jgt, 18(5):449-459, 1994. [doi]

1992

Transforming eulerian trailsHerbert Fleischner, Gert Sabidussi, Emanuel Wenger. DM, 109(1-3):103-116, 1992. [doi]

Spanning eularian subgraphs, the splitting Lemma, and Petersen s theoremHerbert Fleischner. DM, 101(1-3):33-37, 1992. [doi]

A solution to a colouring problem of P. ErdösHerbert Fleischner, Michael Stiebitz. DM, 101(1-3):39-48, 1992. [doi]

Detecting Cycles Through Three Fixed Vertices in a GraphHerbert Fleischner, Gerhard J. Woeginger. ipl, 42(1):29-33, 1992.

1990

On circuit decomposition of planar Eulerian graphsHerbert Fleischner, András Frank. JCT, 50(2):245-253, 1990. [doi]

On the maximum number of pairwise compatible euler cyclesHerbert Fleischner, Anthony J. W. Hilton, Bill Jackson. jgt, 14(1):51-63, 1990. [doi]

1989

Elementary proofs of (relatively) recent characterizations of Eulerian graphsHerbert Fleischner. DAM, 24(1-3):115-119, 1989. [doi]

1988

Removable edges in cyclically 4-edge-connected cubic graphsLars Døvling Andersen, Herbert Fleischner, Bill Jackson. gc, 4(1):1-21, 1988. [doi]

1987

Compatible path-cycle-decompositions of plane graphsHerbert Fleischner, Bill Jackson. JCT, 42(1):94-121, 1987. [doi]

1986

Proof of the strong 2-Cover Conjecture for planar graphsHerbert Fleischner. JCT, 40(2):229-230, 1986. [doi]

1983

Even cycles with prescribed chords in planar cubic graphsHerbert Fleischner. DM, 44(3):275-280, 1983. [doi]

1980

Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeidenHerbert Fleischner. JCT, 29(2):145-167, 1980. [doi]

1979

Three-regular subgraphs of four-regular graphsVasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen. jgt, 3(4):371-386, 1979. [doi]

1977

On the Equivalence of Mealy-Type and Moore-Type Automata and a Relation between Reducibility and Moore-ReducibilityHerbert Fleischner. jcss, 14(1):1-16, 1977.

1973

The uniquely embeddable planar graphsHerbert Fleischner. DM, 4(4):347-358, 1973. [doi]

Sign in or sign up to see more results.

runs on WebDSL