The following pages link to (Q4882549):
Displaying 25 items.
- Multiple list colouring of planar graphs (Q345127) (← links)
- A sufficient condition for a planar graph to be 4-choosable (Q526822) (← links)
- List precoloring extension in planar graphs (Q536235) (← links)
- Planar graphs without cycles of specific lengths (Q697075) (← links)
- On choosability with separation of planar graphs without adjacent short cycles (Q723623) (← links)
- A small non-\(\mathbb Z_4\)-colorable planar graph (Q879348) (← links)
- Distance constraints in graph color extensions (Q885289) (← 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)
- You can't paint yourself into a corner (Q1272489) (← links)
- Extending graph colorings (Q1569052) (← links)
- A sufficient condition for planar graphs to be (3,1)-choosable (Q1679498) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- DP-4-coloring of planar graphs with some restrictions on cycles (Q1981697) (← links)
- On group choosability of graphs. II (Q2014707) (← links)
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces (Q2121742) (← links)
- \(4\)-colouring of generalized signed planar graphs (Q2194082) (← links)
- The Alon-Tarsi number of a planar graph minus a matching (Q2200936) (← links)
- A refinement of choosability of graphs (Q2284741) (← links)
- List coloring and diagonal coloring for plane graphs of diameter two (Q2286099) (← links)
- On list-coloring outerplanar graphs (Q3528160) (← links)
- A tour through Mirzakhani’s work on moduli spaces of Riemann surfaces (Q5122995) (← links)
- List 4-colouring of planar graphs (Q6170786) (← links)
- On two problems of defective choosability of graphs (Q6657596) (← links)
- List dynamic 4-coloring of planar graphs (Q6660058) (← links)
