Pages that link to "Item:Q4330738"
From MaRDI portal
The following pages link to A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs (Q4330738):
Displaying 19 items.
- Distance edge-colourings and matchings (Q714033) (← links)
- On the strong chromatic index of sparse graphs (Q1658764) (← links)
- Distance colouring without one cycle length (Q1689995) (← links)
- Bounding the strong chromatic index of dense random graphs (Q1827703) (← links)
- Strong edge colorings of uniform graphs (Q1887640) (← links)
- Strong cliques and forbidden cycles (Q2288223) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- On distance edge-colourings and matchings (Q2851479) (← links)
- Some Results on Chromatic Number as a Function of Triangle Count (Q3122312) (← links)
- List Colouring Constants of Triangle Free Graphs (Q3503542) (← links)
- On the Lovász Theta Function for Independent Sets in Sparse Graphs (Q4571926) (← links)
- Distance Colouring Without One Cycle Length (Q4962592) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Edge‐coloring linear hypergraphs with medium‐sized edges (Q5236928) (← links)
- The strong clique index of a graph with forbidden cycles (Q6056786) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree (Q6632801) (← links)
- Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree (Q6659522) (← links)
