A sufficient condition for a planar graph to be -choosable
Authors:
- Renyu XuRXRenyu Xu
- Jian-Liang WuJWJian-Liang Wu
- 1 June 2017
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 224, 120-122
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Planar Graphs without 7-Cycles Are 4-ChoosableSIAM Journal on Discrete Mathematics, 2009
- Choosability and edge choosability of planar graphs without five cyclesApplied Mathematics Letters, 2002
- Planar Graphs Without Cycles of Specific LengthsEuropean Journal of Combinatorics, 2002
- Choosability and Edge Choosability of Planar Graphs without Intersecting TrianglesSIAM Journal on Discrete Mathematics, 2002
- The 4-Choosability of Plane Graphs without 4-CyclesJournal of Combinatorial Theory, Series B, 1999
- The complexity of planar graph choosabilityDiscrete Mathematics, 1996
- Every Planar Graph Is 5-ChoosableJournal of Combinatorial Theory, Series B, 1994
- List colourings of planar graphsDiscrete Mathematics, 1993