Girth and total domination in graphs
From MaRDI portal
Publication:1926051
DOI10.1007/s00373-011-1033-2zbMath1256.05170OpenAlexW2012233899MaRDI QIDQ1926051
Anders Yeo, Michael A. Henning
Publication date: 27 December 2012
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1033-2
Related Items
Domination and total domination in cubic graphs of large girth ⋮ Relating ordinary and total domination in cubic graphs of large girth
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
- Restricted domination in graphs
- Restricted total domination in graphs
- Relating the size of a connected graph to its total and restricted domination numbers
- Restricted domination parameters in graphs
- Total domination in 2-connected graphs and in graphs with no induced 6-cycles
- Girth of sparse graphs
- Bounds related to domination in graphs with minimum degree two
- Graphs with large total domination number