On lower bounds for the chromatic number in terms of vertex degree

DOI10.1016/J.DISC.2011.03.025MaRDI QIDQ2275368zbMATH OpenOpenAlexFDO

Authors Manouchehr Zaker

Publication date 8 August 2011

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numbercoloring numbergraph coloringvertex degree

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• New bounds for the chromatic number of graphs
• On \((\delta, \chi)\)-bounded families of graphs
• Bounds for the chromatic number of a graph
• On the chromatic number of triangle-free graphs of large minimum degree
• On the chromatic number of pentagon-free graphs of large minimum degree

Cites work

• 25 pretty graph colouring problems
• -perfect graphs
• Graph theory
• scientific article; zbMATH DE number 3841900 (Why is no real title available?)
• scientific article; zbMATH DE number 4164900 (Why is no real title available?)
• scientific article; zbMATH DE number 4077268 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Induced subtrees in graphs of large chromatic number
• New bounds for the chromatic number of graphs
• On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs

Cited in

(5)

• Bounds for the chromatic number of graphs with partial information
• On bounding the chromatic number of L-graphs
• New bounds for the chromatic number of graphs
• Treewidth versus clique number. I: Graph classes with a forbidden structure
• An improved lower bound of P(G,L)-P(G,k) for k-assignments L

This page was built for publication: On lower bounds for the chromatic number in terms of vertex degree

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