scientific article; zbMATH DE number 2186978

MaRDI QIDQ3025205zbMATH OpenFDO

Authors M. A. Shalu, S. A. Choudum

Publication date 13 July 2005

zbMATH Keywords

chromatic numberclique number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• On chromatic number of \(\{2K_1+K_2,C_4\}\)-free graphs
• Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
• Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
• Coloring of \((P_5, 4\)-wheel)-free graphs
• A tight linear bound to the chromatic number of (P₅, K₁ +(K₁ K₃))-free graphs

Cited in

(18)

• Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
• Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs
• Star coloring of certain graph classes
• On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs
• Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4
• Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
• Conway-Gordon type theorem for the complete four-partite graph \(K_{3,3,1,1}\)
• The structure of \(\{ K_{1,3},Z_2\}\)-free graphs
• Star chromatic bounds
• scientific article; zbMATH DE number 5139441 (Why is no real title available?)
• scientific article; zbMATH DE number 7034164 (Why is no real title available?)
• On chromatic number of \(\{2K_1+K_2,C_4\}\)-free graphs
• Coloring of some crown-free graphs
• \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs
• -boundedness and related problems on graphs without long induced paths: a survey
• Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
• Odd clique minors and chromatic bounds of {\(3K_1\), paraglider}-free graphs
• Square-free graphs with no induced fork

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 Q3025205)