Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Planar Graphs Without 5-and 8-Cycles and Adjacent Triangles are 3-Colorable

Sakib A . Mondal1
1Enterprise Analytics Group India Science Lab, General Motors Global R&D, GM Technical Centre India Pvt Ltd, Creator Bldg., ITPL, Whitefield Road, Bangalore – 560 066, INDIA
  • Published: 31/05/2012

Abstract

In this paper we prove that every planar graph without \(5\)- and \(8\)-cycles and without adjacent triangles is \(3\)-colorable.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Sakib A . Mondal. Planar Graphs Without 5-and 8-Cycles and Adjacent Triangles are 3-Colorable[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 081. 81-95. DOI: .