The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Herbert Fleischner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Herbert Fleischner, Robert R. Molina, Ken W. Smith, Douglas B. West
    A Proof of the Two-path Conjecture. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  2. Lars Døvling Andersen, Herbert Fleischner
    The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:3, pp:203-214 [Journal]
  3. Lars Døvling Andersen, Herbert Fleischner, Susanne Regner
    Algorithms and Outerplanar Conditions for A-trails in Plane Eulerian Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:85, n:2, pp:99-112 [Journal]
  4. Herbert Fleischner
    (Some of) the many uses of Eulerian graphs in graph theory (plus some applications). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:23-43 [Journal]
  5. Herbert Fleischner
    Bipartizing matchings and Sabidussi's compatibility conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:77-82 [Journal]
  6. Herbert Fleischner, Martin Kochol
    A note about the dominating circuit conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:259, n:1-3, pp:307-309 [Journal]
  7. Herbert Fleischner, Stefan Szeider
    Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:49, pp:- [Journal]
  8. Herbert Fleischner, Stefan Szeider
    On Edge-Colored Graphs Covered by Properly Colored Cycles. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:3, pp:301-306 [Journal]
  9. Mark N. Ellingham, Herbert Fleischner, Martin Kochol, Emanuel Wenger
    Colorability of Planar Graphs with Isolated Nontriangular Faces. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:443-446 [Journal]
  10. Herbert Fleischner, Gerhard J. Woeginger
    Detecting Cycles Through Three Fixed Vertices in a Graph. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:42, n:1, pp:29-33 [Journal]
  11. Herbert Fleischner
    On the Equivalence of Mealy-Type and Moore-Type Automata and a Relation between Reducibility and Moore-Reducibility. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1977, v:14, n:1, pp:1-16 [Journal]
  12. Herbert Fleischner
    Proof of the strong 2-Cover Conjecture for planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:229-230 [Journal]
  13. Herbert Fleischner, András Frank
    On circuit decomposition of planar Eulerian graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:245-253 [Journal]
  14. Herbert Fleischner, Bill Jackson
    Compatible path-cycle-decompositions of plane graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:1, pp:94-121 [Journal]
  15. Herbert Fleischner
    Eulersche linien und Kreisüberdeckungen, die vorgegebene durchgänge in den Kanten vermeiden. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1980, v:29, n:2, pp:145-167 [Journal]
  16. Herbert Fleischner, Oliver Kullmann, Stefan Szeider
    Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:503-516 [Journal]
  17. Herbert Fleischner
    Even cycles with prescribed chords in planar cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:44, n:3, pp:275-280 [Journal]
  18. Herbert Fleischner
    A numbering of the vertices of special networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:263-276 [Journal]
  19. Herbert Fleischner
    Spanning eularian subgraphs, the splitting Lemma, and Petersen's theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:33-37 [Journal]
  20. Herbert Fleischner, Michael Stiebitz
    A solution to a colouring problem of P. Erdös. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:39-48 [Journal]
  21. Herbert Fleischner, Gert Sabidussi, Emanuel Wenger
    Transforming eulerian trails. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:109, n:1-3, pp:103-116 [Journal]

  22. Covering Graphs with Few Complete Bipartite Subgraphs. [Citation Graph (, )][DBLP]


  23. Elementary proofs of (relatively) recent characterizations of Eulerian graphs. [Citation Graph (, )][DBLP]


  24. Circuit double covers in special types of cubic graphs. [Citation Graph (, )][DBLP]


  25. Hamiltonicity in vertex envelopes of plane cubic graphs. [Citation Graph (, )][DBLP]


  26. Maximum independent sets in 3- and 4-regular Hamiltonian graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002