On coupon coloring of Cartesian product of some graphs

DOI10.1007/978-3-030-67899-9_25OpenAlexW3126570440MaRDI QIDQ831735

N. E. Zubov

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_25

zbMATH Keywords

torustotal domination numberproduct graphscoupon chromatic number

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63)

Related Items

Coupon coloring of lexicographic product of graphs, Disjoint total dominating sets in near‐triangulations

Cites Work

• 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
• On total domination in the Cartesian product of graphs
• Cubic graphs with total domatic number at least two
• Coupon-coloring and total domination in Hamiltonian planar triangulations
• On the total domination number of Cartesian products of graphs
• On the injective chromatic number of graphs
• Dominating Cartesian products of cycles
• On coupon colorings of graphs
• Total domination in graphs
• Thoroughly dispersed colorings