scientific article; zbMATH DE number 1076145

MaRDI QIDQ4359588zbMATHFDO

Authors Nirmala Achuthan, N. R. Achuthan, Mudin Simanihuruk

Publication date 22 February 1998

zbMATH Keywords

chromatic numbercolouringtriangle-free graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
• On defective colorings of triangle-free graphs with prescribed maximum degree
• scientific article; zbMATH DE number 1076149
• On the chromatic number of triangle-free graphs of large minimum degree
• Minimal definable graphs of definable chromatic number at least three
• An open problem on \(k\)-defective colourings of triangle-free graphs and their complements
• scientific article; zbMATH DE number 4137784
• Triangle-free graphs with large chromatic numbers
• On minimal triangle-free 6-chromatic graphs
• scientific article; zbMATH DE number 3959463

Cited in

(6)

• Extremal results on defective colorings of graphs
• Exact Algorithms for a One-defective Vertex Colouring Problem
• The Nordhaus-Gaddum problem for the \(k\)-defective chromatic number of a \(P_4\)-free graph
• An open problem on \(k\)-defective colourings of triangle-free graphs and their complements
• On minimal triangle-free graphs with prescribed \(k\)-defective chromatic number
• On defective colorings of triangle-free graphs with prescribed maximum degree

This page was built for publication:

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