On \(m\)-centers in \(P_ t\)-free graphs

DOI10.1016/0012-365X(94)90155-4zbMath0799.05062OpenAlexW2014038864MaRDI QIDQ1322266

Odile Favaron, Jean-Luc Fouquet

Publication date: 14 November 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90155-4

zbMATH Keywords

cyclepath\(k\)-center\(k\)-domination

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Graph theory (05C99)

Related Items (2)

Infinite versus finite graph domination ⋮ Complete description of forbidden subgraphs in the structural domination problem

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum induced trees in graphs
• Complement reducible graphs
• Dominating cliques in \(P_ 5\)-free graphs
• Relations between packing and covering numbers of a tree
• On the perfect graph conjecture
• A characterization of graphs without long induced paths

This page was built for publication: On \(m\)-centers in \(P_ t\)-free graphs