Pages that link to "Item:Q616366"
From MaRDI portal
The following pages link to Acyclic 4-choosability of planar graphs (Q616366):
Displaying 24 items.
- Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
- A note on the acyclic 3-choosability of some planar graphs (Q708344) (← links)
- Total 4-choosability of series-parallel graphs (Q870016) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
- On acyclic 4-choosability of planar graphs without short cycles (Q982617) (← links)
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957) (← links)
- Planar graphs without 4- and 5-cycles are acyclically 4-choosable (Q1949098) (← links)
- The 4-choosability of planar graphs and cycle adjacency (Q1981715) (← links)
- On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 (Q2032901) (← links)
- Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles (Q2042281) (← links)
- Coloring graphs without bichromatic cycles or paths (Q2045232) (← links)
- Acyclic choosability of graphs with bounded degree (Q2119462) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- \((4,2)\)-choosability of planar graphs with forbidden structures (Q2409516) (← links)
- Every toroidal graph is acyclically 8-choosable (Q2440482) (← links)
- Choosability with union separation of planar graphs without cycles of length 4 (Q2656689) (← links)
- \((4,1)^*\)-choosability of planar graphs (Q2719962) (← links)
- Acyclic choosability of planar graphs: a Steinberg like approach (Q2851463) (← links)
- A sufficient condition for planar graphs to be acyclically 5-choosable (Q2888884) (← links)
- Acyclic 4-choosability of planar graphs without 4-cycles (Q3297010) (← links)
- Planar graphs without 4-cycles are acyclically 6-choosable (Q3652536) (← links)
- (Q4578234) (← links)
- Acyclic 4-choosability of planar graphs without intersecting short cycles (Q4603881) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5901353) (← links)
