On chromatic transversal domination in graphs

MaRDI QIDQ2839725zbMATH OpenFDO

Authors S. Arumugam, K. Raja Chandrasekar

Publication date 12 July 2013

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

lower boundsdominationcoloringupper boundsMycielskianchromatic transversal domination number

Mathematics Subject Classification ID

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

Recommendations

• A note on the chromatic transversal domination number of a class of graphs
• Chromatic transversal domination in graphs
• On graphs with equal chromatic transversal domination and connected domination numbers
• Chromatic transversal domatic number of graphs
• Chromatic connected domination in graphs

Cited in

(8)

• Domination in transitive colorings of tournaments
• scientific article; zbMATH DE number 7034041 (Why is no real title available?)
• Chromatic transversal domination in graphs
• Chromatic transversal Roman domination in graphs
• Chromatic transversal domatic number of graphs
• A Transition from Total Domination in Graphs to Transversals in Hypergraphs
• On graphs with equal chromatic transversal domination and connected domination numbers
• A note on the chromatic transversal domination number of a class of graphs

This page was built for publication: On chromatic transversal domination in graphs

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