The linear arboricity of planar graphs with maximum degree at least 5

  • Authors:

  • Hong-Yu Chen;Jian-Ming Qi

  • Affiliations:

  • School of Sciences, Shanghai Institute of Technology, Shanghai, 201418, China;Department of Mathematics and Physics, Shanghai Dianji University, Shanghai, 201306, China

  • Venue:
  • Information Processing Letters
  • Year:
  • 2012

Quantified Score

Hi-index 0.89

Visualization

Abstract

Let G be a planar graph with maximum degree @D(G)=5. It is proved that la(G)=@?@D(G)2@? if G has no intersecting 4-cycles and intersecting 5-cycles.