Pages that link to "Item:Q2461774"

The following pages link to An upper bound for the chromatic number of line graphs (Q2461774):

Displaying 11 items.

• Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• A superlocal version of Reed's conjecture (Q490262) (← links)
• Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
• On hitting all maximum cliques with an independent set (Q3067059) (← links)
• Rainbow neighbourhood number of graphs (Q3295009) (← links)
• A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω (Q3466351) (← links)
• Bounding χ in terms of ω and Δ for quasi-line graphs (Q3605150) (← links)
• Graph coloring approach with new upper bounds for the chromatic number: team building application (Q4611483) (← links)
• Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ (Q4982280) (← links)
• Hitting all maximum cliques with a stable set using lopsided independent transversals (Q5199419) (← links)