The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Eckhard Steffen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gunnar Brinkmann, Eckhard Steffen
    Snarks and Reducibility. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  2. Eckhard Steffen, Xuding Zhu
    Star Chromatic Numbers of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:3, pp:439-448 [Journal]
  3. Hans Georg Carstens, Thomas Dinski, Eckhard Steffen
    Reduction of Symmetric Configurations n3. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:99, n:1-3, pp:401-411 [Journal]
  4. Eckhard Steffen, Tomaz Pisanski, Marko Boben, Natasa Ravnik
    Erratum to "Reduction of symmetric configurations n3" [Discrete Appl. Math. 99 (1-3) (2000) 401 -411] [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:11, pp:1645-1646 [Journal]
  5. Eckhard Steffen
    A refinement of Vizing's theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:218, n:1-3, pp:289-291 [Journal]
  6. Eckhard Steffen
    Measurements of edge-uncolorability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:280, n:1-3, pp:191-214 [Journal]
  7. Gunnar Brinkmann, Eckhard Steffen
    Chromatic-Index-Critical Graphs of Orders 11 and 12. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:8, pp:889-900 [Journal]
  8. Stefan Grünewald, Eckhard Steffen
    Independent sets and 2-factors in edge-chromatic-critical graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:45, n:2, pp:113-118 [Journal]
  9. Eckhard Steffen
    Classifications and characterizations of snarks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:183-203 [Journal]
  10. Eckhard Steffen
    Counterexamples to a conjecture about bottlenecks in non-Tait-colourable cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:161, n:1-3, pp:315- [Journal]
  11. Gunnar Brinkmann, Eckhard Steffen
    3- and 4-critical graphs of small even order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:169, n:1-3, pp:193-197 [Journal]

  12. Maximum $\Delta$-edge-colorable subgraphs of class II graphs [Citation Graph (, )][DBLP]


  13. Bricks and conjectures of Berge, Fulkerson and Seymour [Citation Graph (, )][DBLP]


  14. Measures of edge-uncolorability [Citation Graph (, )][DBLP]


  15. Tutte's 5-flow conjecture for highly cyclically connected cubic graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002