On (3, r)-choosability of some planar graphs
From MaRDI portal
Publication:2117577
DOI10.1007/S40840-021-01218-4zbMATH Open1485.05062OpenAlexW4206560000MaRDI QIDQ2117577FDOQ2117577
Authors: Heng Li, Hongguo Zhu, Jianfeng Hou 
Publication date: 21 March 2022
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-021-01218-4
Recommendations
- Choosability with union separation of planar graphs without cycles of length 4
- Choosability with union separation of triangle-free planar graphs
- On choosability with separation of planar graphs with forbidden cycles
- On choosability with separation of planar graphs without adjacent short cycles
- A sufficient condition for planar graphs to be (3,1)-choosable
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Every planar graph is 5-choosable
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- 3-list-coloring planar graphs of girth 5
- Colorings and orientations of graphs
- The 4-choosability of plane graphs without 4-cycles
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
- On choosability with separation of planar graphs without adjacent short cycles
- Planar graphs without intersecting 5-cycles are 4-choosable
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable
- Choosability with union separation
- Choosability with union separation of triangle-free planar graphs
- List coloring triangle‐free planar graphs
Cited In (7)
- Title not available (Why is that?)
- Title not available (Why is that?)
- ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on 3-choosability of planar graphs related to Montanssier's conjecture
- On \(( 2 , r )\)-choosability of planar graphs without short cycles
This page was built for publication: On \((3, r)\)-choosability of some planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117577)
