On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number

DOI10.1016/j.disc.2010.08.013zbMath1222.05044OpenAlexW1980349757MaRDI QIDQ539861

Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk

Publication date: 31 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.08.013

zbMATH Keywords

triangle-free graphs\(k\)-independence\(k\)-defective chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item ⋮ Parameterized (Approximate) Defective Coloring ⋮ Defective Coloring on Classes of Perfect Graphs

Cites Work

• Extremal results on defective colorings of graphs
• Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency
• A note on defective colorings of graphs in surfaces
• On minimal 5-chromatic triangle-free graphs
• Small graphs with chromatic number 5: A computer search
• Graphs with Monochromatic Complete Subgraphs in Every Edge Coloring
• Sur le coloriage des graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item