Pages that link to "Item:Q1569053"
From MaRDI portal
The following pages link to Coloring graphs with sparse neighborhoods (Q1569053):
Displayed 46 items.
- A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors (Q443903) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Lower bounds for independence numbers of some locally sparse graphs (Q489716) (← links)
- Ramsey numbers of some bipartite graphs versus complete graphs (Q659665) (← links)
- The list chromatic number of graphs with small clique number (Q1633755) (← links)
- Distance colouring without one cycle length (Q1689995) (← links)
- Dense induced bipartite subgraphs in triangle-free graphs (Q2003768) (← links)
- Structure and colour in triangle-free graphs (Q2034076) (← links)
- Multicolor Ramsey numbers via pseudorandom graphs (Q2294097) (← links)
- On the chromatic number of the Erdős-Rényi orthogonal polarity graph (Q2344823) (← links)
- Distributed coloring algorithms for triangle-free graphs (Q2347810) (← links)
- Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable (Q2403691) (← links)
- The chromatic number of random Cayley graphs (Q2509709) (← links)
- Random regular graphs of high degree (Q2746213) (← links)
- Coloring Sparse Hypergraphs (Q2813339) (← links)
- Coloring Powers and Girth (Q2827489) (← links)
- Independent Sets in Polarity Graphs (Q2832577) (← links)
- Coloring H-free hypergraphs (Q3055875) (← links)
- The Final Size of the<i>C</i><sub>4</sub>-Free Process (Q3103637) (← links)
- Some Results on Chromatic Number as a Function of Triangle Count (Q3122312) (← links)
- Short proofs of some extremal results III (Q3386524) (← 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)
- The strong chromatic index ofC4-free graphs (Q4521553) (← 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)
- Linear Turán Numbers of Linear Cycles and Cycle-Complete Ramsey Numbers (Q4635508) (← links)
- Distance Colouring Without One Cycle Length (Q4962592) (← links)
- Independent dominating sets in graphs of girth five (Q4993127) (← links)
- Mixing properties of colourings of the ℤ<i><sup>d</sup></i> lattice (Q4993128) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Edge‐coloring linear hypergraphs with medium‐sized edges (Q5236928) (← links)
- On independent sets in hypergraphs (Q5409863) (← links)
- The Distance-<i>t</i> Chromatic Index of Graphs (Q5414148) (← links)
- On the Chromatic Number of Random Graphs with a Fixed Degree Sequence (Q5443802) (← links)
- The <i>C</i><sub>ℓ</sub>‐free process (Q5495878) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
- Colouring graphs with forbidden bipartite subgraphs (Q5885184) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Occupancy fraction, fractional colouring, and triangle fraction (Q6080864) (← 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)
- On triangle-free list assignments (Q6184549) (← links)
- Packing list‐colorings (Q6185050) (← links)