Partitioning the vertices of a cubic graph into two total dominating sets

DOI10.1016/j.dam.2017.01.032zbMath1465.05125OpenAlexW2592971550MaRDI QIDQ2030435

Teresa W. Haynes, Wyatt J. Desormeaux, Michael A. Henning

Publication date: 7 June 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.01.032

zbMATH Keywords

claw-free graphvertex partitionstotal domination5-chordal graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (13)

Minimal graphs with disjoint dominating and paired-dominating sets ⋮ Partitioning claw-free subcubic graphs into two dominating sets ⋮ Semipaired domination in claw-free cubic graphs ⋮ Maker-breaker total domination game ⋮ Maker-Breaker total domination game on cubic graphs ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Disjoint dominating and 2-dominating sets in graphs ⋮ A characterization of graphs with disjoint total dominating sets ⋮ Spanning trees with disjoint dominating and 2-dominating sets ⋮ Domination versus total domination in claw-free cubic graphs ⋮ Upper total domination in claw-free cubic graphs ⋮ Disjoint paired-dominating sets in cubic graphs ⋮ Triangles and (total) domination in subcubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Induced 2-regular subgraphs in \(k\)-chordal cubic graphs
• A Dirac-type characterization of \(k\)-chordal graphs
• Locating-total domination in claw-free cubic graphs
• Dominating and total dominating partitions in cubic graphs
• A survey of selected recent results on total domination in graphs
• Claw-free graphs---a survey
• Treewidth for graphs with small chordality
• Dirac-type characterizations of graphs without long chordless cycles
• Every 8-uniform 8-regular hypergraph is 2-colorable
• The hardness of 3-uniform hypergraph coloring
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• On 2-Colorings of Hypergraphs
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Hypergraphs with large transversal number and with edge sizes at least 3
• The Even Cycle Problem for Directed Graphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Total Domination in Graphs

This page was built for publication: Partitioning the vertices of a cubic graph into two total dominating sets