Pages that link to "Item:Q1126188"
From MaRDI portal
The following pages link to The complexity of planar graph choosability (Q1126188):
Displayed 21 items.
- Complexity of clique coloring and related problems (Q551168) (← links)
- Dynamic list coloring of bipartite graphs (Q608280) (← links)
- Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable (Q629363) (← links)
- Planar graphs without cycles of specific lengths (Q697075) (← links)
- What is on his mind? (Q709300) (← links)
- Some recent progress and applications in graph minor theory (Q878052) (← links)
- Complexity of unique list colorability (Q935144) (← links)
- Locally planar graphs are 5-choosable (Q958683) (← links)
- On 3-choosability of planar graphs without certain cycles (Q963411) (← links)
- The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415) (← links)
- Some results on \((a:b)\)-choosability (Q1025484) (← links)
- On 3-choosable planar graphs of girth at least 4 (Q1025501) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- Color-critical graphs on a fixed surface (Q1369650) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- Smaller planar triangle-free graphs that are not 3-list-colorable (Q1772422) (← links)
- The 3-choosability of plane graphs of girth 4 (Q1781982) (← links)
- On structure of some plane graphs with application to choosability (Q1850547) (← links)
- Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
- A note on 3-choosability of planar graphs (Q2380076) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)