Journals in DBLP

Graphs and Combinatorics
2001, volume: 17, number: 3

1. Lawrence Brenton, Lynda Jaje
   Perfectly Weighted Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2001, v:17, n:3, pp:389-407 [Journal]
   
2. Guantao Chen, Bing Wei, Xuerong Zhang
   Degree-Light-Free Graphs and Hamiltonian Cycles. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2001, v:17, n:3, pp:409-434 [Journal]
   
3. Celina M. Herrera de Figueiredo, Frédéric Maffray, Oscar Porto
   On the Structure of Bull-Free Perfect Graphs, 2: the Weakly Chordal Case. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2001, v:17, n:3, pp:435-456 [Journal]
   
4. H. L. Fu, Christopher A. Rodger
   Four-Cycle Systems with Two-Regular Leaves. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2001, v:17, n:3, pp:457-461 [Journal]
   
5. Zoltán Füredi, Douglas B. West
   Ramsey Theory and Bandwidth of Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2001, v:17, n:3, pp:463-471 [Journal]
   
6. Gregory Gutin, Anders Yeo
   Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2001, v:17, n:3, pp:473-477 [Journal]
   
7. Ryan B. Hayward
   Bull-Free Weakly Chordal Perfectly Orderable Graphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2001, v:17, n:3, pp:479-500 [Journal]
   
8. M. Kano, Haruhide Matsuda
   Partial Parity (g, ?f )-Factors and Subgraphs Covering Given Vertex Subsets. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2001, v:17, n:3, pp:501-509 [Journal]
   
9. Keiko Kotani
   Factors and Connected Induced Subgraphs. [Citation Graph (0, 0)][DBLP]
   Graphs and Combinatorics, 2001, v:17, n:3, pp:511-515 [Journal]
   
10. Raffaele Mosca
    A Property About Minimum Edge- and Minimum Clique-Cover of a Graph. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:517-528 [Journal]
    
11. Seiya Negami, Atsuhiro Nakamoto
    Triangulations on Closed Surfaces Covered by Vertices of Given Degree. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:529-537 [Journal]
    
12. Alex D. Scott
    On Induced Subgraphs with All Degrees Odd. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:539-553 [Journal]
    
13. Zhiren Sun, Feng Tian, Bing Wei
    Degree Sums, Connectivity and Dominating Cycles in Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:555-564 [Journal]
    
14. Zhiren Sun, Feng Tian, Bing Wei
    Long Cycles Passing Through a Specified Edge in 3-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:565-577 [Journal]
    
15. Raphael Yuster
    Large Monotone Paths in Graphs with Bounded Degree. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2001, v:17, n:3, pp:579-587 [Journal]