Journals in DBLP

Discrete Mathematics
2006, volume: 306, number: 3

1. Anne Berry, Jean R. S. Blair, Geneviève Simonet
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:3, pp:293- [Journal]
   
2. Pinar Heggernes
   Minimal triangulations of graphs: A survey. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:3, pp:297-317 [Journal]
   
3. Anne Berry, Pinar Heggernes, Yngve Villanger
   A vertex incremental approach for maintaining chordality. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:3, pp:318-336 [Journal]
   
4. Hans L. Bodlaender, Arie M. C. A. Koster
   Safe separators for treewidth. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:3, pp:337-350 [Journal]
   
5. L. Sunil Chandran, Fabrizio Grandoni
   A linear time algorithm to list the minimal separators of chordal graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:3, pp:351-358 [Journal]
   
6. L. Sunil Chandran, Telikepalli Kavitha
   The treewidth and pathwidth of hypercubes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:3, pp:359-365 [Journal]
   
7. Dieter Kratsch, Jeremy Spinrad
   Minimal fill in O(n^2.69) time. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:3, pp:366-371 [Journal]
   
8. Frédéric Mazoit
   Listing all the minimal separators of a 3-connected planar graph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:3, pp:372-380 [Journal]
   
9. Stavros D. Nikolopoulos, Leonidas Palios
   Minimal separators in P₄-sparse graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2006, v:306, n:3, pp:381-392 [Journal]
   
10. Yngve Villanger
    Lex M versus MCS-M. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:3, pp:393-400 [Journal]