Some sufficient conditions for a planar graph to be of Class 1

Peter Che Bor Lam, Jiazhuang Liu, Wai Chee Shiu, Jianliang Wu

Research output: Contribution to journalJournal article

Abstract

In this paper, we first give some upper bounds on the number of edges for two classes of planar graphs. Then using these upper bounds, we obtain some sufficient conditions for a planar graph to be of Class 1.
Original languageEnglish
Pages (from-to)201-205
Number of pages5
JournalCongressus Numerantium
Volume136
Publication statusPublished - Dec 1999

User-Defined Keywords

  • chromatic index
  • planar graph
  • Class 1 graph

Fingerprint

Dive into the research topics of 'Some sufficient conditions for a planar graph to be of Class 1'. Together they form a unique fingerprint.

Cite this