Relating ordinary and total domination in cubic graphs of large girth
From MaRDI portal
Publication:5419942
DOI10.1007/978-88-7642-475-5_9zbMath1293.05259OpenAlexW1023722853MaRDI QIDQ5419942
Deiwison S. Machado, Simone Dantas, Felix Joos, Dieter Rautenbach, Christian Löwenstein
Publication date: 11 June 2014
Published in: The Seventh European Conference on Combinatorics, Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-88-7642-475-5_9
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of selected recent results on total domination in graphs
- Total domination in graphs with given girth
- Girth and total domination in graphs
- Construction of trees and graphs with equal domination parameters
- Domination in graphs of minimum degree at least two and large girth
- Domination number of cubic graphs with large girth
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Domination in Cubic Graphs of Large Girth
This page was built for publication: Relating ordinary and total domination in cubic graphs of large girth