On 3-choosability of planar graphs without certain cycles
From MaRDI portal
Publication:3538580
zbMATH Open1164.05357MaRDI QIDQ3538580FDOQ3538580
Authors: Lianying Miao, Jibin Qu, Shi-you Pang, Zhengke Miao 
Publication date: 24 November 2008
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cited In (17)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable
- Title not available (Why is that?)
- On Non 3-Choosable Bipartite Graphs
- Title not available (Why is that?)
- Planar graphs that have non short cycles with a chord are 3-choosable
- A note on 3-choosability of planar graphs
- Title not available (Why is that?)
- A note on 3-choosability of planar graphs related to Montanssier's conjecture
- Title not available (Why is that?)
- Retracted article: ``On 3-choosability of planar graphs with neither adjacent triangles nor 5-, 6- and 9-cycles
- The use of Euler's formula in (3,1)*-list-coloring
- A note on the not 3-choosability of some families of planar graphs
- Automated Deduction in Geometry
- Some structural properties of planar graphs and their applications to 3-choosability
- Cyclicity of several planar graphics and ensembles through three singular points without generic conditions
- On 3-choosability of planar graphs without certain cycles
- On \(( 2 , r )\)-choosability of planar graphs without short cycles
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)
