Document Open Access Logo

Partitioning H-Free Graphs of Bounded Diameter

Authors Christoph Brause, Petr Golovach , Barnaby Martin, Daniël Paulusma , Siani Smith

PDF
Thumbnail PDF

File

LIPIcs.ISAAC.2021.21.pdf
  • Filesize: 0.7 MB
  • 14 pages

Document Identifiers

Author Details

Christoph Brause
  • Technische Universität Bergakademie Freiberg, Germany
Petr Golovach
  • University of Bergen, Norway
Barnaby Martin
  • Department of Computer Science, Durham University, UK
Daniël Paulusma
  • Department of Computer Science, Durham University, UK
Siani Smith
  • Department of Computer Science, Durham University, UK

Funding

  • Paulusma, Daniël: Supported by the Leverhulme Trust (RPG-2016-258).

Cite AsGet BibTex

Christoph Brause, Petr Golovach, Barnaby Martin, Daniël Paulusma, and Siani Smith. Partitioning H-Free Graphs of Bounded Diameter. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.ISAAC.2021.21

Abstract

A natural way of increasing our understanding of NP-complete graph problems is to restrict the input to a special graph class. Classes of H-free graphs, that is, graphs that do not contain some graph H as an induced subgraph, have proven to be an ideal testbed for such a complexity study. However, if the forbidden graph H contains a cycle or claw, then these problems often stay NP-complete. A recent complexity study (MFCS 2019) on the k-Colouring problem shows that we may still obtain tractable results if we also bound the diameter of the H-free input graph. We continue this line of research by initiating a complexity study on the impact of bounding the diameter for a variety of classical vertex partitioning problems restricted to H-free graphs. We prove that bounding the diameter does not help for Independent Set, but leads to new tractable cases for problems closely related to 3-Colouring. That is, we show that Near-Bipartiteness, Independent Feedback Vertex Set, Independent Odd Cycle Transversal, Acyclic 3-Colouring and Star 3-Colouring are all polynomial-time solvable for chair-free graphs of bounded diameter. To obtain these results we exploit a new structural property of 3-colourable chair-free graphs.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph theory
Keywords
  • vertex partitioning problem
  • H-free
  • diameter
  • complexity dichotomy

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. Vladimir E. Alekseev. The effect of local constraints on the complexity of determination of the graph independence number. Combinatorial-Algebraic Methods in Applied Mathematics, pages 3-13, 1982 (in Russian). Google Scholar
  2. Vladimir E. Alekseev. Polynomial algorithm for finding the largest independent sets in graphs without forks. Discrete Applied Mathematics, 135:3-16, 2004. Google Scholar
  3. Manuel Bodirsky, Jan Kára, and Barnaby Martin. The complexity of surjective homomorphism problems - A survey. Discrete Applied Mathematics, 160:1680-1690, 2012. Google Scholar
  4. Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, and Pascal Ochem Siani Smith. Acyclic, star and injective colouring: A complexity picture for H-free graphs. CoRR, abs/2008.09415 (conference version in Proc. ESA 2020, LIPIcs 173, 22:1-22:22), 2021. URL: http://arxiv.org/abs/2008.09415.
  5. Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, and Daniël Paulusma. Independent feedback vertex sets for graphs of bounded diameter. Information Processing Letters, 131:26-32, 2018. Google Scholar
  6. Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, and Daniël Paulusma. Independent feedback vertex set for P₅-free graphs. Algorithmica, 81:1342-1369, 2019. Google Scholar
  7. Andreas Brandstädt, Van Bang Le, and Jeremy P. Spinrad. Graph Classes: A Survey, volume 3 of SIAM Monographs on Discrete Mathematics and Applications. SIAM, 1999. Google Scholar
  8. Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, and Siani Smith. Acyclic, star and injective colouring: bounding the diameter. Proc. WG 2021, LNCS, 12911:336-348, 2021. Google Scholar
  9. Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, and Daniël Paulusma. Three complexity results on coloring P_k-free graphs. European Journal of Combinatorics, 34(3):609-619, 2013. Google Scholar
  10. Nina Chiarelli, Tatiana R. Hartinger, Matthew Johnson, Martin Milanič, and Daniël Paulusma. Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity. Theoretical Computer Science, 705:75-83, 2018. Google Scholar
  11. Maria Chudnovsky. The structure of bull-free graphs II and III - A summary. Journal of Combinatorial Theory, Series B, 102:252-282, 2012. Google Scholar
  12. Maria Chudnovsky and Paul D. Seymour. The structure of claw-free graphs. Surveys in Combinatorics, London Mathematical Society Lecture Note Series, 327:153-171, 2005. Google Scholar
  13. Konrad K. Dabrowski, Matthew Johnson, and Daniël Paulusma. Clique-width for hereditary graph classes. Proc. BCC 2019, London Mathematical Society Lecture Note Series, 456:1-56, 2019. Google Scholar
  14. Michał Dębski, Marta Piecyk, and Paweł Rzążewski. Faster 3-coloring of small-diameter graphs. Proc. ESA 2021, LIPIcs, 204:37:1-37:15, 2021. Google Scholar
  15. Keith Edwards. The complexity of colouring problems on dense graphs. Theoretical Computer Science, 43:337-343, 1986. Google Scholar
  16. Petr A. Golovach, Matthew Johnson, Daniël Paulusma, and Jian Song. A survey on the computational complexity of colouring graphs with forbidden subgraphs. Journal of Graph Theory, 84:331-363, 2017. Google Scholar
  17. Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen, and Gerhard J. Woeginger. Domination when the stars are out. ACM Transactions on Algorithms, 15:25:1-25:90, 2019. Google Scholar
  18. John Hopcroft and Robert Tarjan. Algorithm 447: Efficient algorithms for graph manipulation. Communications of the ACM, 16(6):372-378, 1973. Google Scholar
  19. Daniel Král', Jan Kratochvíl, Zsolt Tuza, and Gerhard J. Woeginger. Complexity of coloring graphs without forbidden induced subgraphs. Proc. WG 2001, LNCS, 2204:254-262, 2001. Google Scholar
  20. Barnaby Martin, Daniël Paulusma, and Siani Smith. Colouring H-free graphs of bounded diameter. Proc. MFCS 2019, LIPIcs, 138:14:1-14:14, 2019. Google Scholar
  21. Barnaby Martin, Daniël Paulusma, and Siani Smith. Colouring graphs of bounded diameter in the absence of small cycles. Proc. CIAC 2021, LNCS, 12701:367-380, 2021. Google Scholar
  22. George B. Mertzios and Paul G. Spirakis. Algorithms and almost tight results for 3-Colorability of small diameter graphs. Algorithmica, 74:385-414, 2016. Google Scholar
  23. Andrea Munaro. On line graphs of subcubic triangle-free graphs. Discrete Mathematics, 340:1210-1226, 2017. Google Scholar
  24. Giacomo Paesani, Daniël Paulusma, and Paweł Rzążewski. Feedback Vertex Set and Even Cycle Transversal for H-free graphs: finding large block graphs. Proc. MFCS 2021, LIPIcs, 202:82:1-82:14, 2021. Google Scholar
  25. Daniël Paulusma. Open problems on graph coloring for special graph classes. Proc. WG 2015, LNCS, 9224:16-30, 2015. Google Scholar
  26. Svatopluk Poljak. A note on stable sets and colorings of graphs. Commentationes Mathematicae Universitatis Carolinae, 15:307-309, 1974. Google Scholar
  27. Bert Randerath and Ingo Schiermeyer. Vertex colouring and forbidden subgraphs - A survey. Graphs and Combinatorics, 20:1-40, 2004. Google Scholar
  28. Najiba Sbihi. Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé. Discrete Mathematics, 29:53-76, 1980. Google Scholar
  29. Thomas J. Schaefer. The complexity of satisfiability problems. Proc. STOC 1978, pages 216-226, 1978. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact