On domatic number of graphs

DOI10.30495/JME.V17I0.2597MaRDI QIDQ6541131zbMATH OpenFDO

Authors Mehrnoosh Shadravan, R. A. Borzooei

Publication date 17 May 2024

Published in Journal of Mathematical Extension (Search for Journal in Brave)

Full work available at URL https://doi.org/10.30495/JME.V17I0.2597

zbMATH Keywords

closed-coupon coloringcoupon coloringdomatic numbervertex coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• The domatic number problem
• scientific article; zbMATH DE number 1124606
• scientific article; zbMATH DE number 1161319
• The k-domatic number of a graph
• scientific article; zbMATH DE number 1792633

Cites work

• Coupon coloring of some special graphs
• Deploying robots with two sensors in \(K_{1,6}\)-free graphs
• Distributed control of robotic networks: a mathematical approach to motion coordination algorithms.
• Graph theory with applications
• Injective coloring of planar graphs with girth 7
• Injective colorings of graphs with low average degree
• Injective colorings of sparse graphs
• On coupon colorings of graphs
• Some bounds on the injective chromatic number of graphs
• Some results on the injective chromatic number of graphs

Cited in

(1)

• Graphs with minimum fractional domatic number

This page was built for publication: On domatic number of graphs

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