Concepedia
Discrete Mathematics · 2018 · 24 citations · 4 references
Natural SciencesMathematicsCombinatoricsComputational GeometryTopologyGeometric GraphsGraph AlgorithmsGraph ColoringGraph TheoryColoring Planar GraphsPlanar GraphsVertex Coloring
4
The 4-Choosability of Plane Graphs without 4-Cycles
Peter Che Bor Lam, Baogang Xu · Journal of Combinatorial Theory Series B · 1999 · 81 citations
Natural Sciences, Computer Science, Mathematics +9
The asymptotic behavior of the correspondence chromatic number
Anton Bernshteyn · Discrete Mathematics · 2016 · 63 citations · Full text
Natural Sciences, Mathematics, Physics +4
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles
Weifan Wang, Ko‐Wei Lih · SIAM Journal on Discrete Mathematics · 2002 · 57 citations
Natural Sciences, Computer Science, Mathematics +10
Planar graphs without 4-cycles adjacent to triangles are 4-choosable
Panpan Cheng, Min Chen, Yingqian Wang · Discrete Mathematics · 2016 · 15 citations
Natural Sciences, Mathematics, Combinatorics +8