Journals in DBLP

Discrete Applied Mathematics
2002, volume: 120, number: 1-3

1. Claudio Arbib, Michele Flammini
   On the upper chromatic number of (v₃, b₂)-configurations. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:3-12 [Journal]
   
2. Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel
   Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:13-23 [Journal]
   
3. Stephan Brandt
   Triangle-free graphs and forbidden subgraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:25-33 [Journal]
   
4. Hajo Broersma, Liming Xiong
   A note on minimum degree conditions for supereulerian graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:35-43 [Journal]
   
5. Hajo Broersma, Xueliang Li
   Some approaches to a conjecture on short cycles in digraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:45-53 [Journal]
   
6. Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh
   k-Subdomination in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:55-60 [Journal]
   
7. Janka Chlebíková
   The structure of obstructions to treewidth and pathwidth. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:61-71 [Journal]
   
8. Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani
   An approximation result for the interval coloring problem on claw-free chordal graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:73-90 [Journal]
   
9. Celina M. Herrera de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter
   A note on transitive orientations with maximum sets of sources and sinks. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:91-95 [Journal]
   
10. Miranca Fischermann, Lutz Volkmann
    Graphs having distance-n domination number half their order. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:97-107 [Journal]
    
11. Yubao Guo, Jin Ho Kwak
    The cycle structure of regular multipartite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:109-116 [Journal]
    
12. Thomas Harmuth
    An inductive definition of cubic toroidal maps. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:117-140 [Journal]
    
13. Sandi Klavzar, Uros Milutinovic, Ciril Petr
    On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:141-157 [Journal]
    
14. Masataka Nakamura
    A single-element extension of antimatroids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:159-164 [Journal]
    
15. Stavros D. Nikolopoulos
    Coloring permutation graphs in parallel. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:165-195 [Journal]
    
16. Patric R. J. Östergård
    A fast algorithm for the maximum clique problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:197-207 [Journal]
    
17. Artem V. Pyatkin
    The incidentor coloring of multigraphs and its applications. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:209-217 [Journal]
    
18. Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann
    Vertex pancyclic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:219-237 [Journal]
    
19. Meike Tewes
    Pancyclic orderings of in-tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:239-249 [Journal]
    
20. Hein van der Holst, José Coelho de Pina
    Length-bounded disjoint paths in planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:251-261 [Journal]
    
21. Hansjoachim Walther
    Polyhedral graphs with extreme numbers of types of faces. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:263-274 [Journal]
    
22. Blaz Zmazek, Janez Zerovnik
    Algorithm for recognizing Cartesian graph bundles. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:275-302 [Journal]