DeepAI AI Chat
Log In Sign Up

Odd coloring of two subclasses of planar graphs

by   Mengke Qi, et al.
Xidian University

A proper coloring of a graph is odd if every non-isolated vertex has some color that appears an odd number of times on its neighborhood. Petruševski and Škrekovski conjectured in 2021 that every planar graph admits an odd 5-coloring. We confirm this conjecture for outer-1-planar graphs and 2-boundary planar graphs, which are two subclasses of planar graphs.


page 1

page 2

page 3

page 4


2-distance 4-coloring of planar subcubic graphs with girth at least 21

A 2-distance k-coloring of a graph is a proper vertex k-coloring where v...

The proper conflict-free k-coloring problem and the odd k-coloring problem are NP-complete on bipartite graphs

A proper coloring of a graph is proper conflict-free if every non-isolat...

Bounding generalized coloring numbers of planar graphs using coin models

We study Koebe orderings of planar graphs: vertex orderings obtained by ...

Coloring circle arrangements: New 4-chromatic planar graphs

Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement gr...

A Study of Weisfeiler-Leman Colorings on Planar Graphs

The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that co...

Computer assisted discharging procedure on planar graphs: application to 2-distance coloring

Using computational techniques we provide a framework for proving result...

Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model

In this paper, we consider distributed coloring for planar graphs with a...