Journals in DBLP

Graphs and Combinatorics
2005, volume: 21, number: 4

1. Noga Alon, Raphael Yuster
   On a Hypergraph Matching Problem. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:4, pp:377-384 [Journal]
   
2. Rongquan Feng, Jin Ho Kwak
   Circulant Double Coverings of a Circulant Graph of Valency Four. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:4, pp:385-400 [Journal]
   
3. Daniela Ferrarello, Ralf Fröberg
   The Hilbert Series of the Clique Complex. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:4, pp:401-405 [Journal]
   
4. Catherine S. Greenhill, Oleg Pikhurko
   Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:4, pp:407-419 [Journal]
   
5. Arne Hoffmann, Lutz Volkmann
   Structural Remarks on Bipartite Graphs with Unique f-Factors. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:4, pp:421-425 [Journal]
   
6. Bill Jackson, Tibor Jordán
   Rigid Two-Dimensional Frameworks with Three Collinear Points. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:4, pp:427-444 [Journal]
   
7. Su Jianji, Yuan Xudong
   Contractible Edges in 7-Connected Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:4, pp:445-457 [Journal]
   
8. Ou Jianping, Fuji Zhang
   Super Restricted Edge Connectivity of Regular Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:4, pp:459-467 [Journal]
   
9. Hong-Jian Lai, Xiangwen Li
   On Group Chromatic Number of Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2005, v:21, n:4, pp:469-474 [Journal]
   
10. James G. Lefevre
    Trade Spectrum of K₄-e. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:4, pp:475-488 [Journal]
    
11. Mei Lu, Huiqing Liu, Feng Tian
    Fan-Type Theorem for Long Cycles Containing a Specified Edge. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:4, pp:489-501 [Journal]
    
12. Haruko Okamura
    Two Paths Joining Given Vertices in 2k-Edge-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:4, pp:503-514 [Journal]
    
13. Rong-si Chen
    Perfect Matchings of Generalized Polyomino Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:4, pp:515-529 [Journal]
    
14. Shu-Dong Wang, Shan-Chen Pang
    The Determination of the Total Chromatic Number of Series-Parallel Graphs with (G) >= 4. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:4, pp:531-540 [Journal]
    
15. Xuebin Zhang
    RHPMDs and FHPMDs with k=4 and Type 4^u. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:4, pp:541-552 [Journal]