The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
1985, volume: 38, number: 3

  1. Bojan Mohar, John Shawe-Taylor
    Distance-biregular graphs with 2-valent vertices and distance-regular line graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:193-203 [Journal]
  2. Vojtech Rödl, Zsolt Tuza
    On color critical graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:204-213 [Journal]
  3. Jozef Sirán, Martin Skoviera
    Quotients of connected regular graphs of even degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:214-225 [Journal]
  4. P. Hanlon
    The chromatic polynomial of an unlabeled graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:226-239 [Journal]
  5. Robin Thomas
    Graphs without K4 and well-quasi-ordering. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:240-247 [Journal]
  6. Fan R. K. Chung, Paul Erdös, Joel H. Spencer
    Extremal subgraphs for two graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:248-260 [Journal]
  7. Marie-Claude Heydemann, Dominique Sotteau
    About some cyclic properties in digraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:261-278 [Journal]
  8. Derek A. Holton, Bennet Manvel, Brendan D. McKay
    Hamiltonian cycles in cubic 3-connected bipartite planar graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:279-297 [Journal]
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