Eternal domination and clique covering
From MaRDI portal
Publication:5054057
DOI10.5614/ejgta.2022.10.2.19zbMath1499.05477arXiv2110.09732OpenAlexW3205515510MaRDI QIDQ5054057
Virgélot Virgile, Gary MacGillivray, Christina M. Mynhardt
Publication date: 29 November 2022
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.09732
Uses Software
Cites Work
- Geometric algorithms and combinatorial optimization
- Domination, eternal domination, and clique covering
- Practical graph isomorphism. II.
- A characterization of perfect graphs
- Normal hypergraphs and the perfect graph conjecture
- Eternal and Secure Domination in Graphs
- Protecting a graph with mobile guards
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Eternal domination and clique covering