The 4-Choosability of Plane Graphs without 4-Cycles

Peter Che Bor Lam*, Baogang Xu, Jiazhuang Liu

*Corresponding author for this work

Research output: Contribution to journalJournal articlepeer-review

61 Citations (Scopus)


A graphGis calledk-choosable ifkis a number such that if we give lists ofkcolors to each vertex ofGthere is a vertex coloring ofGwhere each vertex receives a color from its own list no matter what the lists are. In this paper, it is shown that each plane graph without 4-cycles is 4-choosable.

Original languageEnglish
Pages (from-to)117-126
Number of pages10
JournalJournal of Combinatorial Theory. Series B
Issue number1
Publication statusPublished - May 1999
Externally publishedYes

Scopus Subject Areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

User-Defined Keywords

  • 4-cycle
  • Choosability
  • List coloring
  • Plane graph


Dive into the research topics of 'The 4-Choosability of Plane Graphs without 4-Cycles'. Together they form a unique fingerprint.

Cite this