Herbert Fleischner

	2010
29		Herbert Fleischner, Gert Sabidussi, Vladimir I. Sarvanov: Maximum independent sets in 3- and 4-regular Hamiltonian graphs. Discrete Mathematics 310(20): 2742-2749 (2010)
	2009
28		Herbert Fleischner, Arthur M. Hobbs, Michael Tapfuma Muzheve: Hamiltonicity in vertex envelopes of plane cubic graphs. Discrete Mathematics 309(14): 4793-4809 (2009)
27		Herbert Fleischner, Roland Häggkvist: Circuit double covers in special types of cubic graphs. Discrete Mathematics 309(18): 5724-5728 (2009)
26		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
25		Herbert Fleischner, Egbert Mujuni, Daniël Paulusma, Stefan Szeider: Covering Graphs with Few Complete Bipartite Subgraphs. FSTTCS 2007: 340-351
24		Herbert Fleischner, François Genest, Bill Jackson: Compatible circuit decompositions of 4-regular graphs. Journal of Graph Theory 56(3): 227-240 (2007)
	2005
23		Herbert Fleischner, Stefan Szeider: On Edge-Colored Graphs Covered by Properly Colored Cycles. Graphs and Combinatorics 21(3): 301-306 (2005)
	2004
22		Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger: Colorability of Planar Graphs with Isolated Nontriangular Faces. Graphs and Combinatorics 20(4): 443-446 (2004)
	2002
21		Herbert Fleischner: Bipartizing matchings and Sabidussi's compatibility conjecture. Discrete Mathematics 244(1-3): 77-82 (2002)
20		Herbert Fleischner, Martin Kochol: A note about the dominating circuit conjecture. Discrete Mathematics 259(1-3): 307-309 (2002)
19		Herbert Fleischner, Robert R. Molina, Ken W. Smith, Douglas B. West: A Proof of the Two-path Conjecture. Electr. J. Comb. 9(1): (2002)
18		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
17		Herbert Fleischner: (Some of) the many uses of Eulerian graphs in graph theory (plus some applications). Discrete Mathematics 230(1-3): 23-43 (2001)
	2000
16		Herbert Fleischner, Stefan Szeider: Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference Electronic Colloquium on Computational Complexity (ECCC) 7(49): (2000)
	1998
15		Lars Døvling Andersen, Herbert Fleischner, Susanne Regner: Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian Graphs. Discrete Applied Mathematics 85(2): 99-112 (1998)
	1997
14		Herbert Fleischner: A numbering of the vertices of special networks. Discrete Mathematics 165-166: 263-276 (1997)
	1995
13		Lars Døvling Andersen, Herbert Fleischner: The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs. Discrete Applied Mathematics 59(3): 203-214 (1995)
	1992
12		Herbert Fleischner: Spanning eularian subgraphs, the splitting Lemma, and Petersen's theorem. Discrete Mathematics 101(1-3): 33-37 (1992)
11		Herbert Fleischner, Michael Stiebitz: A solution to a colouring problem of P. Erdös. Discrete Mathematics 101(1-3): 39-48 (1992)
10		Herbert Fleischner, Gert Sabidussi, Emanuel Wenger: Transforming eulerian trails. Discrete Mathematics 109(1-3): 103-116 (1992)
9		Herbert Fleischner, Gerhard J. Woeginger: Detecting Cycles Through Three Fixed Vertices in a Graph. Inf. Process. Lett. 42(1): 29-33 (1992)
	1990
8		Herbert Fleischner, András Frank: On circuit decomposition of planar Eulerian graphs. J. Comb. Theory, Ser. B 50(2): 245-253 (1990)
	1989
7		Herbert Fleischner: Elementary proofs of (relatively) recent characterizations of Eulerian graphs. Discrete Applied Mathematics 24(1-3): 115-119 (1989)
	1988
6		Lars Døvling Andersen, Herbert Fleischner, Bill Jackson: Removable edges in cyclically 4-edge-connected cubic graphs. Graphs and Combinatorics 4(1): 1-21 (1988)
	1987
5		Herbert Fleischner, Bill Jackson: Compatible path-cycle-decompositions of plane graphs. J. Comb. Theory, Ser. B 42(1): 94-121 (1987)
	1986
4		Herbert Fleischner: Proof of the strong 2-Cover Conjecture for planar graphs. J. Comb. Theory, Ser. B 40(2): 229-230 (1986)
	1983
3		Herbert Fleischner: Even cycles with prescribed chords in planar cubic graphs. Discrete Mathematics 44(3): 275-280 (1983)
	1980
2		Herbert Fleischner: Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeiden. J. Comb. Theory, Ser. B 29(2): 145-167 (1980)
	1977
1		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)

Coauthor Index

1	Lars Døvling Andersen	[6] [13] [15]
2	Mark N. Ellingham	[22]
3	András Frank	[8]
4	François Genest	[24]
5	Roland Häggkvist	[27]
6	Arthur M. Hobbs	[28]
7	Bill Jackson	[5] [6] [24]
8	Martin Kochol	[20] [22]
9	Oliver Kullmann	[18]
10	Robert R. Molina	[19]
11	Egbert Mujuni	[25] [26]
12	Michael Tapfuma Muzheve	[28]
13	Daniël Paulusma	[25] [26]
14	Susanne Regner	[15]
15	Gert Sabidussi	[10] [29]
16	Vladimir I. Sarvanov	[29]
17	Ken W. Smith	[19]
18	Michael Stiebitz	[11]
19	Stefan Szeider	[16] [18] [23] [25] [26]
20	Emanuel Wenger	[10] [22]
21	Douglas B. West	[19]
22	Gerhard J. Woeginger	[9]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page