The SCEAS System
Navigation Menu

Journals in DBLP

J. Comb. Theory, Ser. B
2003, volume: 87, number: 2

  1. Jason I. Brown, Carl A. Hickman, Richard J. Nowakowski
    The independence fractal of a graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:209-230 [Journal]
  2. Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan
    Partitioning into graphs with only small components. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:231-243 [Journal]
  3. Guoli Ding, Zhenzhen Xu, Wenan Zang
    Packing cycles in graphs, II. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:244-253 [Journal]
  4. Daniel P. Sanders, Yue Zhao
    Coloring edges of graphs embedded in a surface of characteristic zero. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:254-263 [Journal]
  5. James F. Geelen, Geoffrey P. Whittle
    Cliques in dense GF(q)-representable matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:264-269 [Journal]
  6. James F. Geelen, A. M. H. Gerards, Geoffrey P. Whittle
    Disjoint cocircuits in matroids with large rank. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:270-279 [Journal]
  7. Yusheng Li, Wenan Zang
    Ramsey numbers involving large dense graphs and bipartite Turán numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:280-288 [Journal]
  8. Stéphane Bessy, Stéphan Thomassé
    Every strong digraph has a spanning strong subgraph with at most n+2 alpha-2 arcs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:289-299 [Journal]
  9. Michele Conforti, Gérard Cornuéjols
    Graphs without odd holes, parachutes or proper wheels: a generalization of Meyniel graphs and of line graphs of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:300-330 [Journal]
  10. Gérard Cornuéjols, Xinming Liu
    A class of perfect graphs containing P6. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:331-347 [Journal]
  11. Feng Ming Dong
    Bounds for mean colour numbers of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:348-365 [Journal]
  12. Paul Balister, Béla Bollobás, Oliver Riordan, Richard H. Schelp
    Graphs with large maximum degree containing no odd cycles of a given length. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:366-373 [Journal]
  13. Alexandr V. Kostochka, Michael Stiebitz
    A new lower bound on the number of edges in colour-critical graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:374-402 [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