Pages that link to "Item:Q5199419"

The following pages link to Hitting all maximum cliques with a stable set using lopsided independent transversals (Q5199419):

Displaying 23 items.

• A set and collection lemma (Q405128) (← links)
• Coloring a graph with \(\Delta-1\) colors: conjectures equivalent to the Borodin-Kostochka conjecture that appear weaker (Q472396) (← links)
• Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
• Polynomial treewidth forces a large grid-like-minor (Q661945) (← links)
• On the list coloring version of Reed's conjecture (Q1689939) (← links)
• Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
• Colouring graphs with sparse neighbourhoods: bounds and applications (Q2131867) (← links)
• The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065) (← links)
• Two more characterizations of König-Egerváry graphs (Q2403804) (← links)
• A different short proof of Brooks' theorem (Q2509552) (← links)
• Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
• Brooks' Theorem and Beyond (Q3466339) (← links)
• A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω (Q3466351) (← links)
• Finding independent transversals efficiently (Q4987260) (← links)
• A Note on Hitting Maximum and Maximal Cliques With a Stable Set (Q5325947) (← links)
• Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)
• Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors (Q6046645) (← links)
• Combinatorics. Abstracts from the workshop held January 1--7, 2023 (Q6052106) (← links)
• When removing an independent set is optimal for reducing the chromatic number (Q6057453) (← links)
• A note on \(\Delta\)-critical graphs (Q6063276) (← links)
• Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings (Q6081880) (← links)
• Large cliques in graphs with high chromatic number (Q6091811) (← links)
• Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)