The following pages link to (Q3922703):
Displayed 50 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) (Q277100) (← links)
- \((3, 1)^*\)-choosability of graphs of nonnegative characteristic without intersecting short cycles (Q282304) (← links)
- List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles (Q294558) (← links)
- A better lower bound on average degree of 4-list-critical graphs (Q311559) (← links)
- Coloring, sparseness and girth (Q312271) (← links)
- A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
- Online containers for hypergraphs, with applications to linear equations (Q326815) (← links)
- Coloring immersion-free graphs (Q326817) (← links)
- When does the list-coloring function of a graph equal its chromatic polynomial (Q345104) (← links)
- Multiple list colouring of planar graphs (Q345127) (← links)
- 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)
- Sum-paintability of generalized theta-graphs (Q497323) (← links)
- A weaker version of a conjecture on list vertex arboricity of graphs (Q497380) (← links)
- On improperly chromatic-choosable graphs (Q497383) (← links)
- On the choosability of claw-free perfect graphs (Q503632) (← links)
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- The coloring game on matroids (Q507509) (← links)
- List coloring of planar graphs with forbidden cycles (Q510959) (← links)
- Degree choosable signed graphs (Q512558) (← links)
- On-line list coloring of matroids (Q516838) (← links)
- Upper bounds for the achromatic and coloring numbers of a graph (Q516843) (← 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)
- Chromatic-choosability of hypergraphs with high chromatic number (Q668048) (← 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)