Irredundant and open irredundant colorings of graphs

zbMATH Open1220.05036MaRDI QIDQ2999985FDOQ2999985

K. Raja Chandrasekar, S. Arumugam, 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)

Cited In (1)

• Edge irredundant colorings in graphs

   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 👍 👎

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)