Graph-Theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Subexponential Algorithms for Variants of Homomorphism Problem in String Graphs
3. Altmetric Badge
   Chapter 2 The 4-Steiner Root Problem
4. Altmetric Badge
   Chapter 3 Hamiltonicity Below Dirac’s Condition
5. Altmetric Badge
   Chapter 4 Maximum Independent Sets in Subcubic Graphs: New Results
6. Altmetric Badge
   Chapter 5 Cyclewidth and the Grid Theorem for Perfect Matching Width of Bipartite Graphs
7. Altmetric Badge
   Chapter 6 Local Approximation of the Maximum Cut in Regular Graphs
8. Altmetric Badge
   Chapter 7 Fixed-Parameter Tractability of Counting Small Minimum ( S ,  T )-Cuts
9. Altmetric Badge
   Chapter 8 Fast Breadth-First Search in Still Less Space
10. Altmetric Badge
    Chapter 9 A Turing Kernelization Dichotomy for Structural Parameterizations of $$\mathcal {F}$$ -Minor-Free Deletion
11. Altmetric Badge
    Chapter 10 Flip Distances Between Graph Orientations
12. Altmetric Badge
    Chapter 11 Graph Functionality
13. Altmetric Badge
    Chapter 12 On Happy Colorings, Cuts, and Structural Parameterizations
14. Altmetric Badge
    Chapter 13 Shortest Reconfiguration of Matchings
15. Altmetric Badge
    Chapter 14 Travelling on Graphs with Small Highway Dimension
16. Altmetric Badge
    Chapter 15 The Power of Cut-Based Parameters for Computing Edge Disjoint Paths
17. Altmetric Badge
    Chapter 16 Geometric Representations of Dichotomous Ordinal Data
18. Altmetric Badge
    Chapter 17 Linear MIM-Width of Trees
19. Altmetric Badge
    Chapter 18 Approximating Minimum Dominating Set on String Graphs
20. Altmetric Badge
    Chapter 19 Classified Rank-Maximal Matchings and Popular Matchings – Algorithms and Hardness
21. Altmetric Badge
    Chapter 20 Maximum Matchings and Minimum Blocking Sets in $$\varTheta _6$$ -Graphs
22. Altmetric Badge
    Chapter 21 A Polynomial-Time Algorithm for the Independent Set Problem in $$\{{P_{10}},C_4,C_6\}$$ -Free Graphs
23. Altmetric Badge
    Chapter 22 Independent Set Reconfiguration Parameterized by Modular-Width
24. Altmetric Badge
    Chapter 23 Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth
25. Altmetric Badge
    Chapter 24 Intersection Graphs of Non-crossing Paths
26. Altmetric Badge
    Chapter 25 Reconfiguring Hamiltonian Cycles in L-Shaped Grid Graphs
27. Altmetric Badge
    Chapter 26 Color Refinement, Homomorphisms, and Hypergraphs
28. Altmetric Badge
    Chapter 27 3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes
29. Altmetric Badge
    Chapter 28 The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms
30. Altmetric Badge
    Chapter 29 Minimal Separators in Graph Classes Defined by Small Forbidden Induced Subgraphs