Pages that link to "Item:Q3605150"

The following pages link to Bounding χ in terms of ω and Δ for quasi-line graphs (Q3605150):

Displaying 24 items.

• On the recognition of fuzzy circular interval graphs (Q408180) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
• Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
• On \((\delta, \chi)\)-bounded families of graphs (Q540113) (← links)
• A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) (Q635519) (← links)
• Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) (Q968410) (← links)
• Disconnected cuts in claw-free graphs (Q2186821) (← links)
• The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
• An upper bound for the chromatic number of line graphs (Q2461774) (← links)
• Domination When the Stars Are Out (Q3012826) (← links)
• Coloring quasi-line graphs (Q3418732) (← links)
• Asymptotics of the chromatic number for quasi-line graphs (Q3503489) (← 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)
• (Q5009627) (← links)
• Induced Disjoint Paths in Claw-Free Graphs (Q5251566) (← links)
• A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs (Q5300483) (← links)
• List-Coloring Claw-Free Graphs with $\Delta-1$ Colors (Q5346550) (← links)
• Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition (Q5501925) (← links)
• Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded (Q6038594) (← links)
• Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
• Large cliques in graphs with high chromatic number (Q6091811) (← links)
• A quick way to verify if a graph is 3-colorable (Q6633531) (← links)