Journals in DBLP

Discrete Applied Mathematics
1994, volume: 51, number: 1-2

1. Ulrich Faigle, Kees Hoede
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:1- [Journal]
   
2. Luitpold Babel, Gottfried Tinhofer
   Hard-to-color Graphs for Connected Sequential Colorings. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:3-25 [Journal]
   
3. Ulrike Baumann
   on Edge-hamiltonian Cayley Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:27-37 [Journal]
   
4. Hajo Broersma, Ingo Schiermeyer
   Subgraphs, Closures and Hamiltonicity. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:39-46 [Journal]
   
5. Elias Dahlhaus
   A Parallel Algorithm for Computing Steiner Trees in Strongly Chordal Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:47-61 [Journal]
   
6. Peter Damaschke
   PLA Folding in Special Graph Classes. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:63-74 [Journal]
   
7. Peter Dankelmann
   Average Distance and Independence Number. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:75-83 [Journal]
   
8. Stefan Felsner, Jens Gustedt, Michel Morvan, Jean-Xavier Rampon
   Constructing Colorings for Diagrams. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:85-93 [Journal]
   
9. Evelyne Flandrin, Jean-Luc Fouquet, Hao Li
   Hamiltonicity of Bipartite Biclaw-free Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:95-102 [Journal]
   
10. Jochen Harant, Hansjoachim Walther
    A Lower Bound for the Shortness Coefficient of a Class of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:103-105 [Journal]
    
11. Xueliang Li, Fuji Zhang
    Hamiltonicity of a Type of Interchange Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:107-111 [Journal]
    
12. Jaroslav Nesetril
    on ordered Graphs and Graph orderings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:113-116 [Journal]
    
13. Thomas Niessen
    How to Find overfull Subgraphs in Graphs with Large Maximum Degree. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:117-125 [Journal]
    
14. Frank Pfeiffer
    A Note on the Half-integral Multiflow-problem Restricted to Minor-closed Classes of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:127-135 [Journal]
    
15. Werner Poguntke
    on Reliable Graphs with Static Routing Plans. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:137-146 [Journal]
    
16. Erich Prisner
    Algorithms for Interval Catch Digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:147-157 [Journal]
    
17. Alain Quilliot, Sun Xiao Chao
    Algorithmic Characterizations of Interval ordered Hypergraphs and Applications. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:159-170 [Journal]
    
18. Horst Sachs, Holger Zernitz
    Remark on the Dimer Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:171-179 [Journal]
    
19. Günter Schaar
    Remarks on Hamiltonian Properties of Powers of Digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:181-186 [Journal]
    
20. Zsolt Tuza
    Inequalities for Minimal Covering Sets in Set Systems of Given Rank. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:187-195 [Journal]
    
21. Margit Voigt, Hansjoachim Walther
    Chromatic Number of Prime Distance Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:197-209 [Journal]
    
22. Lutz Volkmann
    on Graphs with Equal Domination and Covering Numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:211-217 [Journal]
    
23. Angela von Arnim, Colin de la Higuera
    Computing the Jump Number on Semi-orders Is Polynomial. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:219-232 [Journal]
    
24. Mariusz Wozniak
    Embedding Graphs of Small Size. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:51, n:1-2, pp:233-241 [Journal]