Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set

DOI10.7494/opmath.2024.44.4.543zbMath1540.05137MaRDI QIDQ6545237

Michael A. Henning, Teresa W. Haynes

Publication date: 29 May 2024

Published in: Opuscula Mathematica (Search for Journal in Brave)

zbMATH Keywords

cubic graphstoroidal graphsvertex partitionstotal dominationindependent domination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjoint dominating and total dominating sets in graphs
• Dominating and total dominating partitions in cubic graphs
• Independent domination in graphs: A survey and recent results
• Partitioning the vertices of a cubic graph into two total dominating sets
• Every 8-uniform 8-regular hypergraph is 2-colorable
• 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
• Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
• Partitioning a graph into a dominating set, a total dominating set, and something else
• A Characterization of Graphs with Disjoint Dominating and Total Dominating Sets
• Total domination in graphs
• The Even Cycle Problem for Directed Graphs
• ON THE TWO-COLOURING OF HYPERGRAPHS
• Thoroughly dispersed colorings
• Total Domination in Graphs
• Domination in Graphs: Core Concepts
• Structures of Domination in Graphs
• Topics in Domination in Graphs
• A characterization of graphs with disjoint total dominating sets

This page was built for publication: Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set