Pages that link to "Item:Q963411"
From MaRDI portal
The following pages link to On 3-choosability of planar graphs without certain cycles (Q963411):
Displaying 16 items.
- Some structural properties of planar graphs and their applications to 3-choosability (Q658061) (← links)
- A note on the not 3-choosability of some families of planar graphs (Q845679) (← links)
- Cyclicity of several planar graphics and ensembles through three singular points without generic conditions (Q935124) (← links)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- Adaptable choosability of planar graphs with sparse short cycles (Q1045097) (← links)
- On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) (Q1999744) (← links)
- DP-3-coloring of planar graphs without certain cycles (Q2022504) (← links)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart (Q2434715) (← links)
- On \(( 2 , r )\)-choosability of planar graphs without short cycles (Q2698091) (← links)
- A note on 3-choosability of planar graphs related to Montanssier's conjecture (Q2810722) (← links)
- A note on 3-choosability of planar graphs (Q2824705) (← links)
- (Q3011725) (← links)
- 3-Paintability of planar graphs (Q4554554) (← links)
- (Q4680036) (← links)
- (Q5442386) (← links)
