Pages that link to "Item:Q2752204"

The following pages link to A lower bound for the chromatic number of a graph (Q2752204):

Displaying 12 items.

• New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
• New spectral bounds on the chromatic number encompassing all eigenvalues of the adjacency matrix (Q396873) (← links)
• On the chromatic number of a simplicial complex (Q722323) (← links)
• A bound on the chromatic number of an almost planar graph (Q744556) (← links)
• Unified spectral bounds on the chromatic number (Q891325) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• A bound on the total chromatic number (Q1297726) (← links)
• On bounding the chromatic number of L-graphs (Q1918550) (← links)
• Optimization of eigenvalue bounds for the independence and chromatic number of graph powers (Q2065879) (← links)
• More tales of Hoffman: bounds for the vector chromatic number of a graph (Q2107750) (← links)
• A dualistic approach to bounding the chromatic number of a graph (Q2462336) (← links)
• Tales of Hoffman: three extensions of Hoffman's bound on the graph chromatic number (Q2496209) (← links)