Planar graphs without pairwise adjacent 3-,4-,5-, and 6-cycle are 4-choosable

12/24/2018
by   Pongpat Sittitrai, et al.
0

Xu and Wu proved that if every 5-cycle of a planar graph G is not simultaneously adjacent to 3-cycles and 4-cycles, then G is 4-choosable. In this paper, we improve this result as follows. If G is a planar graph without pairwise adjacent 3-,4-,5-, and 6-cycle, then G is 4-choosable.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/03/2018

Every toroidal graph without triangles adjacent to 5-cycles is DP-4-colorable

DP-coloring, also known as correspondence coloring, is introduced by Dvo...
research
04/26/2019

Retracting Graphs to Cycles

We initiate the algorithmic study of retracting a graph into a cycle in ...
research
05/23/2018

Concentric ESN: Assessing the Effect of Modularity in Cycle Reservoirs

The paper introduces concentric Echo State Network, an approach to desig...
research
06/01/2016

Mapping and Localization from Planar Markers

Squared planar markers are a popular tool for fast, accurate and robust ...
research
05/03/2023

The independence ratio of 4-cycle-free planar graphs

We prove that every n-vertex planar graph G with no triangle sharing an ...
research
03/11/2021

Topological Data Analysis of Korean Music in Jeongganbo: A Cycle Structure

Jeongganbo is a unique music representation invented by Sejong the Great...
research
05/28/2018

On the intersection graph of the disks with diameters the sides of a convex n-gon

Given a convex n-gon, we can draw n disks (called side disks) where each...

Please sign up or login with your details

Forgot password? Click here to reset