Pages that link to "Item:Q4982285"
From MaRDI portal
The following pages link to Counterexamples to the List Square Coloring Conjecture (Q4982285):
Displaying 11 items.
- Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors (Q317434) (← links)
- Chromatic-choosability of the power of graphs (Q476310) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- Total equitable list coloring (Q1756126) (← links)
- Strong list-chromatic index of subcubic graphs (Q1800415) (← links)
- Towards a version of Ohba's conjecture for improper colorings (Q2014228) (← links)
- Bipartite graphs whose squares are not chromatic-choosable (Q2260619) (← links)
- Towards an on-line version of Ohba's conjecture (Q2441619) (← links)
- 2-Distance Coloring of Sparse Graphs (Q2930038) (← links)
- A Proof of a Conjecture of Ohba (Q5251204) (← links)
