Irredundant and open irredundant colorings of graphs

MaRDI QIDQ2999985zbMATH OpenFDO

Authors S. Arumugam, K. Raja Chandrasekar, Sudha

Publication date 18 May 2011

zbMATH Keywords

independencedominationirredundanceirredundant coloringopen irredundant coloring

Mathematics Subject Classification ID

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

Recommendations

• Irredundant colorings of graphs
• A note on graphs with open irratic number two
• Edge irredundant colorings in graphs
• A four colorings theorem
• On irredundant Ramsey numbers for graphs

Cited in

(6)

• On irredundance coloring and irredundance compelling coloring of graphs
• Edge irredundant colorings in graphs
• A four colorings theorem
• Irredundant colorings of graphs
• scientific article; zbMATH DE number 4101267 (Why is no real title available?)
• A note on graphs with open irratic number two

This page was built for publication: Irredundant and open irredundant colorings of graphs

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