Disjoint total dominating sets in near‐triangulations
From MaRDI portal
Publication:6142659
DOI10.1002/jgt.23014zbMath1530.05143arXiv2205.06464OpenAlexW4385458062MaRDI QIDQ6142659
No author found.
Publication date: 4 January 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.06464
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- On coupon coloring of Cartesian product of some graphs
- 2-list-coloring planar graphs without monochromatic triangles
- Regular totally domatically full graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Coupon-coloring and total domination in Hamiltonian planar triangulations
- Dominating sets in planar graphs
- The domination number of plane triangulations
- On coupon colorings of graphs
- Total domination in graphs
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Towards a theory of domination in graphs
- Thoroughly dispersed colorings
- Planar graph colorings without short monochromatic cycles
- Total Domination in Graphs
- A characterization of graphs with disjoint total dominating sets
- NP-completeness results for partitioning a graph into total dominating sets
- On domatic and total domatic numbers of Cartesian products of graphs
This page was built for publication: Disjoint total dominating sets in near‐triangulations
