On coupon coloring of Cartesian product of some graphs

DOI10.1007/978-3-030-67899-9_25MaRDI QIDQ831735zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 4127268 (Why is no real title available?)
• A survey of selected recent results on total domination in graphs
• Coupon-coloring and total domination in Hamiltonian planar triangulations
• Cubic graphs with total domatic number at least two
• Dominating Cartesian products of cycles
• On coupon colorings of graphs
• On the injective chromatic number of graphs
• On the total domatic number of regular graphs
• On the total domination number of Cartesian products of graphs
• On total domination in the Cartesian product of graphs
• Regular totally domatically full graphs
• Thoroughly dispersed colorings
• Total domination in graphs
• Total domination number of grid graphs
• Variations on tilings in the Manhattan metric

Cited in

(4)

• Coupon coloring of Kneser graph \(K(n,2)\)
• Disjoint total dominating sets in near‐triangulations
• \(k\)-tuple colorings of the Cartesian product of graphs
• Coupon coloring of lexicographic product of graphs

This page was built for publication: On coupon coloring of Cartesian product of some graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831735)