The SCEAS System
Navigation Menu

Journals in DBLP

Graphs and Combinatorics
2004, volume: 20, number: 4

  1. Stephan Brandt, Mariusz Wozniak
    On Cyclic Packing of a Tree. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:435-442 [Journal]
  2. 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]
  3. Odile Favaron, Michael A. Henning
    Paired-Domination in Claw-Free Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:447-456 [Journal]
  4. Anant P. Godbole, Joseph A. Johnson
    Even 2 × 2 Submatrices of a Random Zero-One Matrix. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:457-466 [Journal]
  5. Wayne Goddard
    Minimum Degree Conditions for Cycles Including Specified Sets of Vertices. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:467-483 [Journal]
  6. Akira Hiraki, Jack H. Koolen
    A Note on Regular Near Polygons. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:485-497 [Journal]
  7. Garth Isaak
    Sum List Coloring Block Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:499-506 [Journal]
  8. Zbigniew Lonc, Mariusz Meszka, Zdzislaw Skupien
    Edge Decompositions of Multigraphs into 3-Matchings. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:507-515 [Journal]
  9. Antoni Marczyk
    On the Set of Cycle Lengths in a Hamiltonian Graph with a Given Maximum Degree. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:517-529 [Journal]
  10. Gaetano Quattrocchi, Zsolt Tuza
    Partition of C 4-Designs into Minimum and Maximum Number of P 3-Designs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:531-540 [Journal]
  11. C. A. Rodger
    Hamilton Decomposable Graphs with Specified Leaves. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:541-543 [Journal]
  12. Ian M. Wanless
    Cycle Switches in Latin Squares. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:545-570 [Journal]
  13. Igor E. Zverovich
    A Solution to a Problem of Jacobson, Kézdy and Lehel. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:4, pp:571-577 [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