The SCEAS System
Navigation Menu

Journals in DBLP

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

  1. Atsushi Kaneko
    A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:195-218 [Journal]
  2. Matt DeVos, Paul D. Seymour
    Extending partial 3-colourings in a planar graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:219-225 [Journal]
  3. Akira Saito
    Splitting and contractible edges in 4-connected graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:227-235 [Journal]
  4. Hiroshi Maehara
    Plane graphs with straight edges whose bounded faces are acute triangles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:237-245 [Journal]
  5. Zoltán Szigeti
    On the graphic matroid parity problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:247-260 [Journal]
  6. James F. Geelen, A. M. H. Gerards, Neil Robertson, Geoff Whittle
    On the excluded minors for the matroids of branch-width k. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:261-265 [Journal]
  7. Anthony J. W. Hilton, Matthew Johnson 0002, Christopher A. Rodger, Evan B. Wantland
    Amalgamations of connected k-factorizations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:267-279 [Journal]
  8. Penny E. Haxell, Tibor Szabó, Gábor Tardos
    Bounded size components--partitions and transversals. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:281-297 [Journal]
  9. Hossein Hajiabolhassan, Xuding Zhu
    Circular chromatic number of Kneser graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:299-303 [Journal]
  10. Jiuqiang Liu
    Hamiltonian decompositions of Cayley graphs on abelian groups of even order. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:305-321 [Journal]
  11. José Coelho de Pina, José Soares
    Improved bound for the Carathéodory rank of the bases of a matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:323-327 [Journal]
  12. Noga Alon, Béla Bollobás, Michael Krivelevich, Benny Sudakov
    Maximum cuts and judicious partitions in graphs without short cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:329-346 [Journal]
  13. Petr Hlinený
    Crossing-number critical graphs have bounded path-width. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:347-367 [Journal]
  14. Ed Swartz
    g-Elements of matroid complexes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:369-375 [Journal]
  15. James F. Geelen, Satoru Iwata, Kazuo Murota
    The linear delta-matroid parity problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:377-398 [Journal]
  16. Jens Vygen
    A note on Schrijver's submodular function minimization algorithm. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:399-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