Domination in a graph with a 2‐factor

DOI10.1002/jgt.20142zbMath1118.05075OpenAlexW4238165609MaRDI QIDQ5471053

Michael D. Plummer, Akira Saito, Ken-ichi Kawarabayashi

Publication date: 6 June 2006

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20142

zbMATH Keywords

2-factorgirthdomination

Mathematics Subject Classification ID

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

Related Items (8)

Domination in Cubic Graphs of Large Girth ⋮ Pairs of disjoint dominating sets in connected cubic graphs ⋮ Domination in graphs of minimum degree at least two and large girth ⋮ Domination in bipartite graphs ⋮ An upper bound on the domination number of \(n\)-vertex connected cubic graphs ⋮ Domination number of cubic graphs with large girth ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ On domination in connected cubic graphs

This page was built for publication: Domination in a graph with a 2‐factor