Journals in DBLP

Discrete Mathematics
2007, volume: 307, number: 7-8

1. Mirko Hornák, Stanislav Jendrol
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:7-8, pp:787- [Journal]
   
2. Michael D. Plummer
   Graph factors and factorization: 1985-2003: A survey. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:7-8, pp:791-821 [Journal]
   
3. Gábor Bacsó, Zsolt Tuza, Margit Voigt
   Characterization of graphs dominated by induced paths. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:7-8, pp:822-826 [Journal]
   
4. Halina Bielak
   Relations between 2-local and 2-mean Ramsey numbers for graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:7-8, pp:827-831 [Journal]
   
5. Hajo Broersma, Liming Xiong, Kiyoshi Yoshimoto
   Toughness and hamiltonicity in k-trees. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:7-8, pp:832-838 [Journal]
   
6. Frank Bullock, Marietjie Frick, Gabriel Semanisin, Róbert Vlacuha
   Nontraceable detour graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:7-8, pp:839-853 [Journal]
   
7. Igor Fabrici, Tomás Madaras
   The structure of 1-planar graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:7-8, pp:854-865 [Journal]
   
8. Igor Fabrici
   Light graphs in families of outerplanar graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:7-8, pp:866-872 [Journal]
   
9. Ralph J. Faudree, Richard H. Schelp, Akira Saito, Ingo Schiermeyer
   Degree conditions for hamiltonicity: Counting the number of missing edges. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:7-8, pp:873-877 [Journal]
   
10. Evelyne Flandrin, Hao Li, Antoni Marczyk, Mariusz Wozniak
    A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:878-884 [Journal]
    
11. Marietjie Frick, Joy Singleton
    Cubic maximal nontraceable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:885-891 [Journal]
    
12. Tobias Gerlach, Jochen Harant
    On a cycle through a specified linear forest of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:892-895 [Journal]
    
13. Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak
    A note on decompositions of transitive tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:896-904 [Journal]
    
14. Erhard Hexel
    On short paths through prescribed vertices of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:905-910 [Journal]
    
15. Bill Jackson, G. Sethuraman, Carol Whitehead
    A note on the Erdos-Farber-Lovász conjecture. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:911-915 [Journal]
    
16. Arnfried Kemnitz, Massimiliano Marangio, Peter Mihók
    [r, s, t]-Chromatic numbers and hereditary properties of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:916-922 [Journal]
    
17. Daniel Král
    Mixed hypergraphs and other coloring problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:923-938 [Journal]
    
18. Tomás Madaras, Riste Skrekovski
    Lightness, heaviness and gravity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:939-951 [Journal]
    
19. Danuta Michalak
    Hereditarily dominated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:952-957 [Journal]
    
20. Peter Mihók, Gabriel Semanisin
    On invariants of hereditary graph properties. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:958-963 [Journal]
    
21. Minh Hoang Nguyen, Mirka Miller, Joan Gimbert
    On mixed Moore graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:964-970 [Journal]
    
22. Monika Pilsniak
    Packing of two digraphs into a transitive tournament. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:971-974 [Journal]
    
23. A. N. M. Salman, Hajo Broersma
    On Ramsey numbers for paths versus wheels. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:975-982 [Journal]
    
24. Jens Schreyer
    Almost every graph is vertex-oblique. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:983-989 [Journal]
    
25. Zdzislaw Skupien
    BCH codes and distance multi- or fractional colorings in hypercubes asymptotically. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:990-1000 [Journal]
    
26. Milan Tuhársky
    Light stars in large polyhedral maps on surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:1001-1012 [Journal]
    
27. Margit Voigt
    A non-3-choosable planar graph without cycles of length 4 and 5. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:1013-1015 [Journal]
    
28. Maciej Zwierzchowski
    Total domination number of the conjunction of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:7-8, pp:1016-1020 [Journal]