Hostname: page-component-7dd5485656-hw7sx Total loading time: 0 Render date: 2025-10-30T12:36:15.207Z Has data issue: false hasContentIssue false
  • English
  • Français

Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles

Published online by Cambridge University Press:  25 June 2001

WANG WEIFAN  and
KO-WEI LIH
WANG WEIFAN
Affiliation:
Department of Mathematics, Liaoning University, Shenyang 110036, P. R. China
KO-WEI LIH
Affiliation:
Institute of Mathematics, Academia Sinica, Nankang, Taipei 115, Taiwan (e-mail: makwlih@sinica.edu.tw)
Get access Rights & Permissions [Opens in a new window]

Abstract

Let G be a planar graph without 6-cycles. We investigate structural properties of G and show that G is edge-(Δ(G) + 1)-choosable when its maximum degree Δ(G) is not 5. We also study the 3-degeneracy property of G.

Information

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 10 , Issue 3 , May 2001 , pp. 267 - 276
Copyright
2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable