default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHerbert Fleischner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j47]Jan Ekstein
, Herbert Fleischner:
The most general structure of graphs with hamiltonian or hamiltonian connected square. Discret. Math. 347(1): 113702 (2024)- 2022
- [j46]Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi:
On Finding Hamiltonian Cycles in Barnette Graphs. Fundam. Informaticae 188(1): 1-14 (2022) - 2021
- [j45]Jan Ekstein, Herbert Fleischner:
A best possible result for the square of a 2-block to be hamiltonian. Discret. Math. 344(1): 112158 (2021) - [j44]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): 269-288 (2021) - 2020
- [j43]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: 125233 (2020) - [j42]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
A model for finding transition-minors. Discret. Appl. Math. 283: 242-264 (2020)
2010 – 2019
- 2019
- [j41]Herbert Fleischner, Roland Häggkvist, Arthur Hoffmann-Ostenhof:
Cycle double covers via Kotzig graphs. J. Comb. Theory B 135: 212-226 (2019) - [j40]Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang:
Cycle covers (III) - Compatible circuit decomposition and K5-transition minor. J. Comb. Theory B 137: 25-54 (2019) - [c4]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
A SAT Approach for Finding Sup-Transition-Minors. LION 2019: 325-341 - 2017
- [j39]Herbert Fleischner:
Reducing an arbitrary fullerene to the dodecahedron. Discret. Math. 340(11): 2714-2722 (2017) - [j38]Herbert Fleischner, Behrooz Bagheri Gh., Cun-Quan Zhang, Zhang Zhang:
Compatible Cycle Decomposition of bad K5-minor-free graphs. Electron. Notes Discret. Math. 61: 445-449 (2017) - [c3]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
Finding Smooth Graphs with Small Independence Numbers. MOD 2017: 527-539 - 2016
- [j37]Ping Li, Hao Li, Ye Chen, Herbert Fleischner, Hong-Jian Lai:
Supereulerian graphs with width s and s-collapsible graphs. Discret. Appl. Math. 200: 79-94 (2016) - [c2]Benedikt Klocker, Herbert Fleischner, Günther R. Raidl:
Finding Uniquely Hamiltonian Graphs of Minimum Degree Three with Small Crossing Numbers. HM 2016: 1-16 - 2015
- [j36]Herbert Fleischner, Roland Häggkvist:
Cycle double covers containing certain circuits in cubic graphs having special structures. Discret. Math. 338(10): 1750-1754 (2015) - 2014
- [j35]Herbert Fleischner:
Uniquely Hamiltonian Graphs of Minimum Degree 4. J. Graph Theory 75(2): 167-177 (2014) - [j34]Herbert Fleischner, Roland Häggkvist:
Cycle Double Covers in Cubic Graphs having Special Structures. J. Graph Theory 77(2): 158-170 (2014) - 2013
- [p2]Herbert Fleischner, Michael Stiebitz:
Some Remarks on the Cycle Plus Triangles Problem. The Mathematics of Paul Erdős II 2013: 119-125 - 2010
- [j33]Herbert Fleischner, Gert Sabidussi, Vladimir I. Sarvanov:
Maximum independent sets in 3- and 4-regular Hamiltonian graphs. Discret. Math. 310(20): 2742-2749 (2010)
2000 – 2009
- 2009
- [j32]Herbert Fleischner, Arthur M. Hobbs, Michael Tapfuma Muzheve:
Hamiltonicity in vertex envelopes of plane cubic graphs. Discret. Math. 309(14): 4793-4809 (2009) - [j31]Herbert Fleischner, Roland Häggkvist:
Circuit double covers in special types of cubic graphs. Discret. Math. 309(18): 5724-5728 (2009) - [j30]Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider:
Covering graphs with few complete bipartite subgraphs. Theor. Comput. Sci. 410(21-23): 2045-2053 (2009) - 2007
- [j29]Herbert Fleischner, François Genest, Bill Jackson:
Compatible circuit decompositions of 4-regular graphs. J. Graph Theory 56(3): 227-240 (2007) - [c1]Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider:
Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS 2007: 340-351 - 2005
- [j28]Herbert Fleischner, Stefan Szeider:
On Edge-Colored Graphs Covered by Properly Colored Cycles. Graphs Comb. 21(3): 301-306 (2005) - 2004
- [j27]Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger:
Colorability of Planar Graphs with Isolated Nontriangular Faces. Graphs Comb. 20(4): 443-446 (2004) - 2003
- [j26]Herbert Fleischner, Gert Sabidussi:
3-colorability of 4-regular hamiltonian graphs. J. Graph Theory 42(2): 125-140 (2003) - [p1]Josep Fàbrega, Miguel Angel Fiol, Herbert Fleischner, R. Gary Parker, A Dewdney, Ronald J. Gould, Gregory Z. Gutin:
Connectivity and Traversability. Handbook of Graph Theory 2003: 193-339 - 2002
- [j25]Herbert Fleischner, Robert R. Molina, Ken W. Smith, Douglas B. West:
A Proof of the Two-path Conjecture. Electron. J. Comb. 9(1) (2002) - [j24]Herbert Fleischner:
Bipartizing matchings and Sabidussi's compatibility conjecture. Discret. Math. 244(1-3): 77-82 (2002) - [j23]Herbert Fleischner, Martin Kochol:
A note about the dominating circuit conjecture. Discret. Math. 259(1-3): 307-309 (2002) - [j22]Herbert Fleischner, Oliver Kullmann, Stefan Szeider:
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theor. Comput. Sci. 289(1): 503-516 (2002) - 2001
- [j21]Herbert Fleischner:
(Some of) the many uses of Eulerian graphs in graph theory (plus some applications). Discret. Math. 230(1-3): 23-43 (2001) - 2000
- [i1]Herbert Fleischner, Stefan Szeider:
Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference. Electron. Colloquium Comput. Complex. TR00 (2000)
1990 – 1999
- 1998
- [j20]Lars Døvling Andersen, Herbert Fleischner, Susanne Regner:
Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian Graphs. Discret. Appl. Math. 85(2): 99-112 (1998) - 1997
- [j19]Herbert Fleischner:
A numbering of the vertices of special networks. Discret. Math. 165-166: 263-276 (1997) - 1995
- [j18]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): 203-214 (1995) - [j17]Mao-cheng Cai, Herbert Fleischner:
An eulerian trail traversing specified edges in given order. J. Graph Theory 19(2): 137-144 (1995) - 1994
- [j16]Herbert Fleischner:
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs. J. Graph Theory 18(5): 449-459 (1994) - 1992
- [j15]Herbert Fleischner:
Spanning eularian subgraphs, the splitting Lemma, and Petersen's theorem. Discret. Math. 101(1-3): 33-37 (1992) - [j14]Herbert Fleischner, Michael Stiebitz:
A solution to a colouring problem of P. Erdös. Discret. Math. 101(1-3): 39-48 (1992) - [j13]Herbert Fleischner, Gert Sabidussi, Emanuel Wenger:
Transforming eulerian trails. Discret. Math. 109(1-3): 103-116 (1992) - [j12]Herbert Fleischner, Gerhard J. Woeginger:
Detecting Cycles Through Three Fixed Vertices in a Graph. Inf. Process. Lett. 42(1): 29-33 (1992) - 1990
- [j11]Herbert Fleischner, András Frank:
On circuit decomposition of planar Eulerian graphs. J. Comb. Theory B 50(2): 245-253 (1990) - [j10]Herbert Fleischner, Anthony J. W. Hilton, Bill Jackson:
On the maximum number of pairwise compatible euler cycles. J. Graph Theory 14(1): 51-63 (1990)
1980 – 1989
- 1989
- [j9]Herbert Fleischner:
Elementary proofs of (relatively) recent characterizations of Eulerian graphs. Discret. Appl. Math. 24(1-3): 115-119 (1989) - 1988
- [j8]Lars Døvling Andersen, Herbert Fleischner, Bill Jackson:
Removable edges in cyclically 4-edge-connected cubic graphs. Graphs Comb. 4(1): 1-21 (1988) - 1987
- [j7]Herbert Fleischner, Bill Jackson:
Compatible path-cycle-decompositions of plane graphs. J. Comb. Theory B 42(1): 94-121 (1987) - 1986
- [j6]Herbert Fleischner:
Proof of the strong 2-Cover Conjecture for planar graphs. J. Comb. Theory B 40(2): 229-230 (1986) - 1983
- [j5]Herbert Fleischner:
Even cycles with prescribed chords in planar cubic graphs. Discret. Math. 44(3): 275-280 (1983) - 1980
- [j4]Herbert Fleischner:
Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeiden. J. Comb. Theory B 29(2): 145-167 (1980)
1970 – 1979
- 1979
- [j3]Vasek Chvátal, Herbert Fleischner, J. Sheehan, Carsten Thomassen:
Three-regular subgraphs of four-regular graphs. J. Graph Theory 3(4): 371-386 (1979) - 1977
- [j2]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): 1-16 (1977) - 1973
- [j1]Herbert Fleischner:
The uniquely embeddable planar graphs. Discret. Math. 4(4): 347-358 (1973)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
