Graphs whose vertex set can be partitioned into a total dominating set and an independent dominating set
From MaRDI portal
Publication:6545237
DOI10.7494/OPMATH.2024.44.4.543zbMATH Open1540.05137MaRDI QIDQ6545237FDOQ6545237
Authors: Teresa W. Haynes, Michael A. Henning 
Publication date: 29 May 2024
Published in: Opuscula Mathematica (Search for Journal in Brave)
Cites Work
- Total domination in graphs
- Total domination in graphs
- Independent domination in graphs: A survey and recent results
- A note on graphs with disjoint dominating and total dominating sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Even Cycle Problem for Directed Graphs
- Disjoint dominating and total dominating sets in graphs
- Every 8-uniform 8-regular hypergraph is 2-colorable
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
- 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
- ON THE TWO-COLOURING OF HYPERGRAPHS
- Dominating and total dominating partitions in cubic graphs
- Domination in Graphs: Core Concepts
- Topics in Domination in Graphs
- Thoroughly dispersed colorings
- Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets
- Structures of Domination in Graphs
- Partitioning the vertices of a cubic graph into two total dominating sets
- Title not available (Why is that?)
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6545237)
