Partitioning claw-free subcubic graphs into two dominating sets
From MaRDI portal
Publication:2657047
Recommendations
Cites work
- 2-colorings in \(k\)-regular \(k\)-uniform hypergraphs
- A survey of selected recent results on total domination in graphs
- Cubic graphs with total domatic number at least two
- Disjoint paired-dominating sets in cubic graphs
- Every 8-uniform 8-regular hypergraph is 2-colorable
- scientific article; zbMATH DE number 4152425 (Why is no real title available?)
- scientific article; zbMATH DE number 4127268 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Partitioning the vertices of a cubic graph into two total dominating sets
- The Even Cycle Problem for Directed Graphs
- Total domination in graphs
Cited in
(2)
This page was built for publication: Partitioning claw-free subcubic graphs into two dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657047)