The following pages link to \(\omega, \Delta\) and \(\chi\) (Q4242948):
Displaying 20 items.
- Algorithmic bounds for the chromatic number† (Q5449019) (← links)
- Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)
- (Q5883218) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5918634) (← links)
- A local epsilon version of Reed's conjecture (Q5919302) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← 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)
- A note on \(\Delta\)-critical graphs (Q6063276) (← links)
- A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
- The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs (Q6081802) (← links)
- (Q6084349) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- Large cliques in graphs with high chromatic number (Q6091811) (← links)
- Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring (Q6566595) (← links)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)
- \(t\)-strong cliques and the degree-diameter problem (Q6621265) (← links)
- A quick way to verify if a graph is 3-colorable (Q6633531) (← links)
- Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree (Q6659522) (← links)
