On coupon coloring of Cartesian product of some graphs

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

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

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

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)