A tight bound for independent domination of cubic graphs without 4‐cycles
From MaRDI portal
Publication:6094034
DOI10.1002/jgt.22968zbMath1522.05354arXiv2112.11720OpenAlexW4367680209MaRDI QIDQ6094034
Hyemin Kwon, Ilkyoo Choi, Eun-Kyung Cho, Boram Park
Publication date: 9 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.11720
Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Cubic graphs with large ratio of independent domination number to domination number
- An introduction to the discharging method via graph coloring
- Linear programming and the worst-case analysis of greedy algorithms on cubic graphs
- Independent domination in subcubic bipartite graphs of girth at least six
- On independent domination number of regular graphs
- On the independent domination number of regular graphs
- Independent domination in graphs: A survey and recent results
- An improved upper bound on the independent domination number in cubic graphs of girth at least six
- Independent sets in regular graphs
- Independent domination in subcubic graphs of girth at least six
- Independent Domination in Cubic Graphs
- Independent dominating sets in graphs of girth five
- On independent domination of regular graphs
This page was built for publication: A tight bound for independent domination of cubic graphs without 4‐cycles
