3-facial colouring of plane graphs
classification
💻 cs.DM
keywords
planegraphcolourablecolouredconjectureeveryfacialvertices
pith:3IO5WFKO Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{3IO5WFKO}
Prints a linked pith:3IO5WFKO badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
A plane graph is l-facially k-colourable if its vertices can be coloured with k colours such that any two distinct vertices on a facial segment of length at most l are coloured differently. We prove that every plane graph is 3-facially 11-colourable. As a consequence, we derive that every 2-connected plane graph with maximum face-size at most 7 is cyclically 11-colourable. These two bounds are for one off from those that are proposed by the (3l+1)-Conjecture and the Cyclic Conjecture.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.