On 3-choosability of planar graphs without certain cycles
From MaRDI portal
Publication:3538580
Recommendations
Cited in
(17)- scientific article; zbMATH DE number 5914884 (Why is no real title available?)
- On 3-choosability of planar graphs without certain cycles
- scientific article; zbMATH DE number 5238998 (Why is no real title available?)
- scientific article; zbMATH DE number 5064026 (Why is no real title available?)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable
- Automated Deduction in Geometry
- Planar graphs that have non short cycles with a chord are 3-choosable
- scientific article; zbMATH DE number 2172647 (Why is no real title available?)
- A note on 3-choosability of planar graphs related to Montanssier's conjecture
- On Non 3-Choosable Bipartite Graphs
- A note on 3-choosability of planar graphs
- A note on the not 3-choosability of some families of planar graphs
- Retracted article: ``On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles
- Some structural properties of planar graphs and their applications to 3-choosability
- On \(( 2 , r )\)-choosability of planar graphs without short cycles
- The use of Euler's formula in (3,1)*-list-coloring
- Cyclicity of several planar graphics and ensembles through three singular points without generic conditions
This page was built for publication: On 3-choosability of planar graphs without certain cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3538580)