Journals in DBLP

Discrete Mathematics
2001, volume: 233, number: 1-3

1. Miroslav Fiedler, Jan Kratochvíl, Jaroslav Nesetril
   Foreword. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:233, n:1-3, pp:1-2 [Journal]
   
2. Jaroslav Nesetril, Eva Milková, Helena Nesetrilová
   Otakar Boruvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:233, n:1-3, pp:3-36 [Journal]
   
3. Luis Boza, Maria Teresa Davila, Alberto Márquez, Rafael Moyano
   Miscellaneous properties of embeddings of line, total and middle graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:233, n:1-3, pp:37-54 [Journal]
   
4. Hajo Broersma, Zdenek Ryjácek
   Strengthening the closure concept in claw-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:233, n:1-3, pp:55-63 [Journal]
   
5. Rostislav Caha, Václav Koubek
   Optimal embeddings of generalized ladders into hypercubes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:233, n:1-3, pp:65-83 [Journal]
   
6. Mao-cheng Cai, Evelyne Flandrin, Hao Li
   On quasifactorability in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:233, n:1-3, pp:85-92 [Journal]
   
7. Hikoe Enomoto
   Graph partition problems into cycles and paths. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:233, n:1-3, pp:93-101 [Journal]
   
8. Daniela Ferrero, Carles Padró
   New bounds on the diameter vulnerability of iterated line digraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:233, n:1-3, pp:103-113 [Journal]
   
9. Dalibor Froncek
   On seed graphs with more than two components. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:233, n:1-3, pp:115-126 [Journal]
   
10. Matús Harminc, Roman Sotak
    Graphs with average labellings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:127-132 [Journal]
    
11. Pavel Hrnciar, Alfonz Haviar
    All trees of diameter five are graceful. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:133-150 [Journal]
    
12. Martin Knor, Ludovít Niepel
    Diameter in iterated path graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:151-161 [Journal]
    
13. Alexandr V. Kostochka, Douglas R. Woodall
    Sparse sets in the complements of graphs with given girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:163-174 [Journal]
    
14. Martin Loebl, Martín Matamala
    Some remarks on cycles in graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:175-182 [Journal]
    
15. Richard J. Nowakowski, C. A. Whitehead
    Ordered graceful labellings of the 2-star. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:183-191 [Journal]
    
16. Meike Tewes
    Pancyclic in-tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:193-204 [Journal]
    
17. Mariusz Wozniak
    Note on compact packing of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:205-210 [Journal]
    
18. Vincent Barré
    On vertex neighborhood in minimal imperfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:211-218 [Journal]
    
19. Frédéric Havet
    Channel assignment and multicolouring of the induced subgraphs of the triangular lattice. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:219-231 [Journal]
    
20. Christopher Carl Heckman, Robin Thomas
    A new proof of the independence ratio of triangle-free cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:233-237 [Journal]
    
21. Arnfried Kemnitz, Massimiliano Marangio
    Chromatic numbers of integer distance graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:239-246 [Journal]
    
22. Martin Kochol
    Stable dominating circuits in snarks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:247-256 [Journal]
    
23. Alexandr V. Kostochka, Jaroslav Nesetril, P. Smolíková
    Colorings and homomorphisms of degenerate and bounded degree graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:257-276 [Journal]
    
24. Jaroslav Nesetril, Xuding Zhu
    Construction of sparse graphs with prescribed circular colorings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:277-291 [Journal]
    
25. Rommel Barbosa, Bert Hartnell
    Characterization of Z_m-well-covered graphs for some classes of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:293-297 [Journal]
    
26. Henry Crapo, Pierre Rosenstiehl
    On lacets and their manifolds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:299-320 [Journal]
    
27. S. Mehdi Hashemi
    Digraph embedding. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:321-328 [Journal]
    
28. Stanislav Jendrol, Heinz-Jürgen Voss
    Light subgraphs of multigraphs on compact 2-dimensional manifolds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:329-351 [Journal]
    
29. Marián Klesc
    The crossing numbers of Cartesian products of paths with 5-vertex graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:353-359 [Journal]
    
30. Jirí Matousek
    Lower bound on the minus-domination number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:361-370 [Journal]
    
31. Jana Maxová, Jaroslav Nesetril
    On oriented path double covers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:371-380 [Journal]
    
32. Blaz Zmazek, Janez Zerovnik
    On recognizing Cartesian graph bundles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:381-391 [Journal]