Pages that link to "Item:Q4852428"

The following pages link to On Brooks' Theorem for Sparse Graphs (Q4852428):

Displaying 37 items.

• The \(m\)-degenerate chromatic number of a digraph (Q267198) (← links)
• Waiter-Client and Client-Waiter planarity, colorability and minor games (Q271623) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• A sequential algorithm for generating random graphs (Q603928) (← links)
• On the chromatic number of simple triangle-free triple systems (Q1010856) (← links)
• Fractional v. integral covers in hypergraphs of bounded edge size (Q1356038) (← links)
• Tail bound for the minimal spanning tree of a complete graph. (Q1423115) (← links)
• The list chromatic number of graphs with small clique number (Q1633755) (← links)
• Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings (Q1775018) (← links)
• Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques (Q2171021) (← links)
• Measurable versions of the Lovász local lemma and measurable graph colorings (Q2319876) (← links)
• Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
• On coupon colorings of graphs (Q2354722) (← links)
• Probabilistic constructions in generalized quadrangles (Q2407032) (← links)
• New upper bounds for the chromatic number of a graph (Q2707978) (← links)
• Coloring Sparse Hypergraphs (Q2813339) (← links)
• Coloring H-free hypergraphs (Q3055875) (← links)
• List coloring triangle-free hypergraphs (Q3452728) (← links)
• On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs (Q4256092) (← links)
• (Q4511485) (← links)
• The strong chromatic index ofC4-free graphs (Q4521553) (← links)
• Random lifts of graphs: Independence and chromatic number (Q4534214) (← links)
• Concentration of non‐Lipschitz functions and applications (Q4537624) (← links)
• On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
• A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
• The Ramsey number <i>R</i>(3, <i>t</i>) has order of magnitude <i>t</i>²/log <i>t</i> (Q4851927) (← links)
• Extremal problems in hypergraph colourings (Q5112450) (← links)
• On the Method of Typical Bounded Differences (Q5366890) (← links)
• Algorithmic bounds for the chromatic number† (Q5449019) (← links)
• Colouring graphs with forbidden bipartite subgraphs (Q5885184) (← links)
• Adaptable and conflict colouring multigraphs with no cycles of length three or four (Q6047975) (← links)
• Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
• (Q6084349) (← links)
• Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
• A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
• Distributed algorithms, the Lovász local lemma, and descriptive combinatorics (Q6107878) (← links)
• On triangle-free list assignments (Q6184549) (← links)