Matched-Factor d-Domatic Coloring of Graphs

DOI10.1137/060662307MaRDI QIDQ3544253zbMATH OpenOpenAlexFDO

Authors K. S. Sudeep, Sundar Vishwanathan

Publication date 5 December 2008

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/060662307

zbMATH Keywords

algorithmsgraph theorydominationmatched-factor domatic number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Factor \(d\)-domatic colorings of graphs
• The algorithmic complexity of \(k\)-domatic partition of graphs
• Domatic Partition on Several Classes of Graphs
• Algorithmic aspects of dominator colorings in graphs
• The domatic number problem

Cited in

(1)

• Factor \(d\)-domatic colorings of graphs

This page was built for publication: Matched-Factor d-Domatic Coloring of Graphs

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