Domination in Cubic Graphs of Large Girth

DOI10.1007/978-3-540-89550-3_20zbMath1162.05341OpenAlexW2125541118MaRDI QIDQ5302753

Dieter Rautenbach, Bruce A. Reed

Publication date: 13 January 2009

Published in: Computational Geometry and Graph Theory (Search for Journal in Brave)

Full work available at URL: https://www.db-thueringen.de/receive/dbt_mods_00009353

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (6)

Pairs of disjoint dominating sets in connected cubic graphs ⋮ Domination and total domination in cubic graphs of large girth ⋮ Partial domination in supercubic graphs ⋮ Relating ordinary and total domination in cubic graphs of large girth ⋮ Independent domination in subcubic bipartite graphs of girth at least six ⋮ Domination number of cubic graphs with large girth

Cites Work

• Unnamed Item
• An upper bound on the domination number of \(n\)-vertex connected cubic graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Domination in graphs of minimum degree at least two and large girth
• On domination in connected cubic graphs
• Paths, Stars and the Number Three
• Minimum independent dominating sets of random cubic graphs
• The dominating number of a random cubic graph
• Domination in a graph with a 2‐factor

This page was built for publication: Domination in Cubic Graphs of Large Girth