Some characterization theorems on dominating chromatic partition-covering number of graphs

DOI10.4067/S0716-09172014000100002MaRDI QIDQ4979893zbMATH OpenFDO

Authors L. Benedict Michael Raj, S. K. Ayyaswamy

Publication date 19 June 2014

Published in Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172014000100002&lng=en&nrm=iso&tlng=en

zbMATH Keywords

dominating setchromatic partitiondominating chromatic partition-covering number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Chromatic connected domination in graphs
• Chromatic total domination in graphs
• Bichromaticity and domatic number of a bipartite graph
• Chromatic transversal domination in graphs
• Dominator and total dominator colorings in graphs

Cited in

(2)

• The dominating partition dimension and locating-chromatic number of graphs
• A note on the chromatic transversal domination number of a class of graphs

This page was built for publication: Some characterization theorems on dominating chromatic partition-covering number of graphs

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