Domatically full Cartesian product graphs
From MaRDI portal
Recommendations
Cites work
- \(k\)-domination and \(k\)-independence in graphs: A survey
- An improved exact algorithm for the domatic number problem
- Domatically critical and domatically full graphs
- Domatically perfect graphs
- scientific article; zbMATH DE number 3639144 (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?)
- Minimal dominating sets in maximum domatic partitions
- On coupon colorings of graphs
- On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset
- The domatic number problem
- The Domatic Number Problem in Interval Graphs
- Towards a theory of domination in graphs
Cited in
(5)
This page was built for publication: Domatically full Cartesian product graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5876780)