The following pages link to (Q3922703):
Displayed 50 items.
- Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable (Q393358) (← links)
- On 1-improper 2-coloring of sparse graphs (Q393935) (← links)
- Application of polynomial method to on-line list colouring of graphs (Q412279) (← links)
- Dense uniform hypergraphs have high list chromatic number (Q432708) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- \(\ell\)-facial edge colorings of graphs (Q479043) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- On-line choice number of complete multipartite graphs: an algorithmic approach (Q490305) (← links)
- Ohba's conjecture for graphs with independence number five (Q536225) (← links)
- List precoloring extension in planar graphs (Q536235) (← links)
- Vertex coloring complete multipartite graphs from random lists of size 2 (Q539865) (← links)
- Complexity of clique coloring and related problems (Q551168) (← links)
- Claw-free graphs. VI: Colouring (Q602712) (← links)
- Dynamic list coloring of bipartite graphs (Q608280) (← links)
- 3-list-coloring planar graphs of girth 4 (Q626855) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) (← links)
- Two problems on independent sets in graphs (Q641174) (← links)
- On two generalizations of the Alon-Tarsi polynomial method (Q651032) (← links)
- Coloring graphs from random lists of size 2 (Q658000) (← links)
- Some structural properties of planar graphs and their applications to 3-choosability (Q658061) (← links)
- List colourings of planar graphs (Q687126) (← links)
- Coloring face hypergraphs on surfaces (Q703607) (← links)
- Injective colorings of sparse graphs (Q710598) (← links)
- Contractibility and the Hadwiger conjecture (Q710728) (← links)
- Brooks' theorem via the Alon-Tarsi theorem (Q712277) (← links)
- Critically paintable, choosable or colorable graphs (Q713164) (← links)
- List total arboricity of 2-degenerate graphs (Q714512) (← links)
- Randić index and coloring number of a graph (Q741549) (← links)
- On \((3, 1)^\ast\)-choosability of planar graphs without adjacent short cycles (Q741735) (← links)
- Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) (Q741736) (← links)
- List-coloring claw-free graphs with small clique number (Q742576) (← links)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- \(\Delta \)-list vertex coloring in linear time (Q844167) (← links)
- The 4-choosability of toroidal graphs without intersecting triangles (Q845970) (← links)
- Some relations among term rank, clique number and list chromatic number of a graph (Q856854) (← links)
- Distance constraints in graph color extensions (Q885289) (← links)
- Extending Hall's theorem into list colorings: a partial history (Q925374) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Another proof of the 5-choosability of \(K_5\)-minor-free graphs (Q932663) (← links)
- Choice number and energy of graphs (Q952058) (← links)
- Hall number for list colorings of graphs: Extremal results (Q960954) (← links)
- On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable (Q975410) (← links)
- Edge-choosability of planar graphs without non-induced 5-cycles (Q976112) (← links)
- Planar graphs are 1-relaxed, 4-choosable (Q976159) (← links)
- The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415) (← links)
- Choice number of complete multipartite graphs \(K_{3*3,2*(k - 5),1*2}\) and \(K_{4,3*2,2*(k - 6),1*3}\) (Q998482) (← links)
- List coloring of graphs having cycles of length divisible by a given number (Q1011504) (← links)
- Ohba's conjecture is true for graphs with independence number at most three (Q1023085) (← links)