Graph-Theoretic Concepts in Computer Science

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Proportionally Fair Matching with Multiple Groups
3. Altmetric Badge
   Chapter 2 Reconstructing Graphs from Connected Triples
4. Altmetric Badge
   Chapter 3 Parameterized Complexity of Vertex Splitting to Pathwidth at Most 1
5. Altmetric Badge
   Chapter 4 Odd Chromatic Number of Graph Classes
6. Altmetric Badge
   Chapter 5 Deciding the Erdős-Pósa Property in 3-Connected Digraphs
7. Altmetric Badge
   Chapter 6 New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth
8. Altmetric Badge
   Chapter 7 Nonplanar Graph Drawings with k Vertices per Face
9. Altmetric Badge
   Chapter 8 Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
10. Altmetric Badge
    Chapter 9 Cutting Barnette Graphs Perfectly is Hard
11. Altmetric Badge
    Chapter 10 Metric Dimension Parameterized by Treewidth in Chordal Graphs
12. Altmetric Badge
    Chapter 11 Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
13. Altmetric Badge
    Chapter 12 Generating Faster Algorithms for  d -Path Vertex Cover
14. Altmetric Badge
    Chapter 13 A New Width Parameter of Graphs Based on Edge Cuts: $$\alpha $$ -Edge-Crossing Width
15. Altmetric Badge
    Chapter 14 Snakes and Ladders: A Treewidth Story
16. Altmetric Badge
    Chapter 15 Parameterized Results on Acyclic Matchings with Implications for Related Problems
17. Altmetric Badge
    Chapter 16 $$\mathcal {P}$$ -Matchings Parameterized by Treewidth
18. Altmetric Badge
    Chapter 17 Algorithms and Hardness for Metric Dimension on Digraphs
19. Altmetric Badge
    Chapter 18 Degreewidth: A New Parameter for Solving Problems on Tournaments
20. Altmetric Badge
    Chapter 19 Approximating Bin Packing with Conflict Graphs via Maximization Techniques
21. Altmetric Badge
    Chapter 20 $$\alpha _i$$ -Metric Graphs: Radius, Diameter and all Eccentricities
22. Altmetric Badge
    Chapter 21 Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor
23. Altmetric Badge
    Chapter 22 Bounds on Functionality and Symmetric Difference – Two Intriguing Graph Parameters
24. Altmetric Badge
    Chapter 23 Cops and Robbers on Multi-Layer Graphs
25. Altmetric Badge
    Chapter 24 Parameterized Complexity of Broadcasting in Graphs
26. Altmetric Badge
    Chapter 25 Turán’s Theorem Through Algorithmic Lens
27. Altmetric Badge
    Chapter 26 On the Frank Number and Nowhere-Zero Flows on Graphs
28. Altmetric Badge
    Chapter 27 On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs
29. Altmetric Badge
    Chapter 28 Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth
30. Altmetric Badge
    Chapter 29 Cops and Robber - When Capturing Is Not Surrounding
31. Altmetric Badge
    Chapter 30 Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths
32. Altmetric Badge
    Chapter 31 Upper Clique Transversals in Graphs
33. Altmetric Badge
    Chapter 32 Critical Relaxed Stable Matchings with Two-Sided Ties
34. Altmetric Badge
    Chapter 33 Graph Search Trees and Their Leaves