Contents

Ars Combinatoria

  • Research article

Pseudo-Outerplanar Graphs and Chromatic Conjectures

Jingjing Tian1, Xin Zhang2
1Department of Applied Mathematics Northwestern Polytechnical University, Xi’an 710072, P.R. China
2Department of Mathematics Xidian University, Xi’an 710071, PR. China
  • Published: 30/04/2014

Abstract

In this paper, we verify the list edge coloring conjecture for pseudo- outerplanar graphs with maximum degree at least \(5\) and the equitable \(\Delta\)-coloring conjecture for all pseudo-outerplanar graphs.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Jingjing Tian, Xin Zhang. Pseudo-Outerplanar Graphs and Chromatic Conjectures[J], Ars Combinatoria, Volume 114. 353-361. .