Graph-Theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Tree-Like Structures in Graphs: A Metric Point of View
3. Altmetric Badge
   Chapter 2 Overview of New Approaches for Approximating TSP
4. Altmetric Badge
   Chapter 3 Linear Rank-Width and Linear Clique-Width of Trees
5. Altmetric Badge
   Chapter 4 Threshold-Coloring and Unit-Cube Contact Representation of Graphs
6. Altmetric Badge
   Chapter 5 Rolling Upward Planarity Testing of Strongly Connected Graphs
7. Altmetric Badge
   Chapter 6 Towards a Provably Resilient Scheme for Graph-Based Watermarking
8. Altmetric Badge
   Chapter 7 The Normal Graph Conjecture for Classes of Sparse Graphs
9. Altmetric Badge
   Chapter 8 On the Parameterized Complexity of Computing Graph Bisections
10. Altmetric Badge
    Chapter 9 Fixed-Parameter Tractability and Characterizations of Small Special Treewidth
11. Altmetric Badge
    Chapter 10 The θ 5 -Graph is a Spanner
12. Altmetric Badge
    Chapter 11 Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations
13. Altmetric Badge
    Chapter 12 Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
14. Altmetric Badge
    Chapter 13 Equilateral L-Contact Graphs
15. Altmetric Badge
    Chapter 14 Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees
16. Altmetric Badge
    Chapter 15 Linear Separation of Total Dominating Sets in Graphs
17. Altmetric Badge
    Chapter 16 Sparse Square Roots
18. Altmetric Badge
    Chapter 17 Completing Colored Graphs to Meet a Target Property
19. Altmetric Badge
    Chapter 18 Colouring of Graphs with Ramsey-Type Forbidden Subgraphs
20. Altmetric Badge
    Chapter 19 Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs
21. Altmetric Badge
    Chapter 20 Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time
22. Altmetric Badge
    Chapter 21 Thickness and Colorability of Geometric Graphs
23. Altmetric Badge
    Chapter 22 The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n -Cube
24. Altmetric Badge
    Chapter 23 Graph-Theoretic Concepts in Computer Science
25. Altmetric Badge
    Chapter 24 Excluding Graphs as Immersions in Surface Embedded Graphs
26. Altmetric Badge
    Chapter 25 OBDD-Based Representation of Interval Graphs
27. Altmetric Badge
    Chapter 26 Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs
28. Altmetric Badge
    Chapter 27 A Linear-Time Kernelization for the Rooted k -Leaf Outbranching Problem
29. Altmetric Badge
    Chapter 28 On Retracts, Absolute Retracts, and Folds in Cographs
30. Altmetric Badge
    Chapter 29 Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors
31. Altmetric Badge
    Chapter 30 On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
32. Altmetric Badge
    Chapter 31 Certifying 3-Edge-Connectivity
33. Altmetric Badge
    Chapter 32 Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
34. Altmetric Badge
    Chapter 33 Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs
35. Altmetric Badge
    Chapter 34 Beyond Knights and Knaves
36. Altmetric Badge
    Chapter 35 Drawing Graphs with Few Arcs
37. Altmetric Badge
    Chapter 36 Connecting Terminals and 2-Disjoint Connected Subgraphs