The following pages link to List colourings of planar graphs (Q687126):
Displaying 50 items.
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
- Local 7-coloring for planar subgraphs of unit disk graphs (Q2430012) (← links)
- Asymptotic enumeration and limit laws for graphs of fixed genus (Q2431243) (← links)
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart (Q2434715) (← links)
- Every toroidal graph is acyclically 8-choosable (Q2440482) (← links)
- Dynamic coloring and list dynamic coloring of planar graphs (Q2446867) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)
- List colourings of planar graphs. (Reprint) (Q2498006) (← links)
- A map colour theorem for the union of graphs (Q2581497) (← links)
- Facial list colourings of plane graphs (Q2629297) (← links)
- Precoloring extension involving pairs of vertices of small distance (Q2636808) (← links)
- Choosability with union separation of planar graphs without cycles of length 4 (Q2656689) (← links)
- Dynamic list coloring of 1-planar graphs (Q2659245) (← links)
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz (Q2685332) (← links)
- On \(( 2 , r )\)-choosability of planar graphs without short cycles (Q2698091) (← links)
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634) (← links)
- List colourings of graphs (Q2741180) (← links)
- On choosability with separation of planar graphs with forbidden cycles (Q2800544) (← links)
- List colorings with distinct list sizes, the case of complete bipartite graphs (Q2811205) (← links)
- Hadwiger’s Conjecture (Q2827298) (← links)
- Coloring of plane graphs with unique maximal colors on faces (Q2833253) (← links)
- Acyclic choosability of planar graphs: a Steinberg like approach (Q2851463) (← links)
- List colorings of \(K_5\)-minor-free graphs with special list assignments (Q2911050) (← links)
- A note on 3-choosability of plane graphs under distance restrictions (Q2966511) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- Improper coloring of unit disk graphs (Q3057115) (← links)
- Acyclic 5-choosability of planar graphs without adjacent short cycles (Q3174245) (← links)
- Filling the complexity gaps for colouring planar and bounded degree graphs (Q3299212) (← links)
- Acyclic improper choosability of graphs (Q3439591) (← links)
- List Colouring Squares of Planar Graphs (Q3503513) (← links)
- On list-coloring outerplanar graphs (Q3528160) (← links)
- Planar graphs without 4-cycles are acyclically 6-choosable (Q3652536) (← links)
- Adapted list coloring of planar graphs (Q3652546) (← links)
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable (Q3652554) (← links)
- Choosability in graphs: Some results and open problems. A survey (Q3977503) (← links)
- List Improper Colourings of Planar Graphs (Q4256694) (← links)
- Acyclic list 7‐coloring of planar graphs (Q4539872) (← links)
- Hyperbolic families and coloring graphs on surfaces (Q4560169) (← links)
- Dirac's map-color theorem for choosability (Q4719323) (← links)
- (Q4888118) (← links)
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)
- IC-Planar Graphs Are 6-Choosable (Q5009330) (← links)
- DP-coloring on planar graphs without given adjacent short cycles (Q5012814) (← links)
- 不含带弦6-圈和项链图的平面图是DP-4-可染的 (Q5038381) (← links)
- Toroidal graphs containing neither nor 6‐cycles are 4‐choosable (Q5272640) (← links)
- On (4, 2)‐Choosable Graphs (Q5272926) (← links)
- Improper Choosability and Property B (Q5325946) (← links)
- Improper choosability of graphs and maximum average degree (Q5486272) (← links)
- Some Conjectures and Questions in Chromatic Topological Graph Theory (Q5506783) (← links)
