Book Volume 4271 2006

Graph-Theoretic Concepts in Computer Science

32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006 Revised Papers


ISBN: 978-3-540-48381-6 (Print) 978-3-540-48382-3 (Online)

Table of contents (31 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Chapter

    Pages 1-14

    Treewidth: Characterizations, Applications, and Computations

  3. Chapter

    Pages 15-26

    Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy

  4. Chapter

    Pages 27-36

    Generalised Dualities and Finite Maximal Antichains

  5. Chapter

    Pages 37-48

    Chordal Deletion Is Fixed-Parameter Tractable

  6. Chapter

    Pages 49-57

    A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators

  7. Chapter

    Pages 58-67


  8. Chapter

    Pages 68-77

    Listing Chordal Graphs and Interval Graphs

  9. Chapter

    Pages 78-89

    A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs

  10. Chapter

    Pages 90-101

    Improved Edge-Coloring with Three Colors

  11. Chapter

    Pages 102-112

    Vertex Coloring of Comparability+ke and –ke Graphs

  12. Chapter

    Pages 113-124

    Convex Drawings of Graphs with Non-convex Boundary

  13. Chapter

    Pages 125-136

    How to Sell a Graph: Guidelines for Graph Retailers

  14. Chapter

    Pages 137-146

    Strip Graphs: Recognition and Scheduling

  15. Chapter

    Pages 147-158

    Approximating the Traffic Grooming Problem in Tree and Star Networks

  16. Chapter

    Pages 159-167

    Bounded Arboricity to Determine the Local Structure of Sparse Graphs

  17. Chapter

    Pages 168-178

    An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time

  18. Chapter

    Pages 179-190

    Partitioned Probe Comparability Graphs

  19. Chapter

    Pages 191-204

    Computing Graph Polynomials on Graphs of Bounded Clique-Width

  20. Chapter

    Pages 205-216

    Generation of Graphs with Bounded Branchwidth

  21. Chapter

    Pages 217-228

    Minimal Proper Interval Completions

previous Page of 2