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

DOI10.4067/S0716-09172014000100002zbMath1408.05105MaRDI QIDQ4979893

S. K. Ayyaswamy, L. Benedict Michael Raj

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

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

Related Items (1)

Unnamed Item

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