A New Characterization of $$P_k$$-free Graphs

DOI10.1007/978-3-319-12340-0_11zbMath1337.05089arXiv1402.7213OpenAlexW1606686642MaRDI QIDQ2945184

Oliver Schaudt, Eglantine Camby

Publication date: 9 September 2015

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1402.7213

zbMATH Keywords

computational complexity\(P_k\)-free graphconnected domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Perfect edge domination: hard and solvable cases ⋮ Three-coloring and list three-coloring of graphs without induced paths on seven vertices

This page was built for publication: A New Characterization of $$P_k$$-free Graphs