On domatic and total domatic numbers of Cartesian products of graphs
From MaRDI portal
Publication:6102218
DOI10.1007/s40840-023-01504-3zbMath1512.05323MaRDI QIDQ6102218
No author found.
Publication date: 8 May 2023
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of selected recent results on total domination in graphs
- Regular totally domatically full graphs
- Variations on tilings in the Manhattan metric
- Total domination number of grid graphs
- Cubic graphs with total domatic number at least two
- Coupon-coloring and total domination in Hamiltonian planar triangulations
- Dominating Cartesian products of cycles
- On coupon colorings of graphs
- Improved sphere bounds on the covering radius of codes
- Total domination in graphs
- Towards a theory of domination in graphs
- Thoroughly dispersed colorings
- Total Domination in Graphs
- NP-completeness results for partitioning a graph into total dominating sets
This page was built for publication: On domatic and total domatic numbers of Cartesian products of graphs