Pages that link to "Item:Q1126188"
From MaRDI portal
The following pages link to The complexity of planar graph choosability (Q1126188):
Displaying 37 items.
- Multiple list colouring of planar graphs (Q345127) (← links)
- A sufficient condition for a planar graph to be 4-choosable (Q526822) (← links)
- 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)
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable (Q738863) (← 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)
- Differences between the list-coloring and DP-coloring for planar graphs (Q2032896) (← links)
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable (Q2078245) (← links)
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces (Q2121742) (← links)
- On the subspace choosability in graphs (Q2138578) (← links)
- DP-4-colorability of planar graphs without adjacent cycles of given length (Q2306602) (← links)
- A note on 3-choosability of planar graphs (Q2380076) (← links)
- On \(t\)-common list-colorings (Q2401414) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)
- Phase transition of degeneracy in minor-closed families (Q2689167) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- (Q5743487) (← links)
- Group coloring and group connectivity with non-isomorphic groups of the same order (Q6564000) (← links)
- Complexity of near-3-choosability problem (Q6632143) (← links)
- On two problems of defective choosability of graphs (Q6657596) (← links)
