Pushable chromatic number of graphs with degree constraints

11/22/2019
by   Julien Bensmail, et al.
0

Pushable homomorphisms and the pushable chromatic number χ_p of oriented graphs were introduced by Klostermeyer and MacGillivray in 2004. They notably observed that, for any oriented graph G, we have χ_p(G) ≤χ_o(G) ≤ 2 χ_p(G), where χ_o(G) denotes the oriented chromatic number of G. This stands as first general bounds on χ_p. This parameter was further studied in later works.This work is dedicated to the pushable chromatic number of oriented graphs fulfilling particular degree conditions. For all Δ≥ 29, we first prove that the maximum value of the pushable chromatic number of an oriented graph with maximum degree Δ lies between 2^Δ/2-1 and (Δ-3) · (Δ-1) · 2^Δ-1 + 2 which implies an improved bound on the oriented chromatic number of the same family of graphs. For subcubic oriented graphs, that is, when Δ≤ 3, we then prove that the maximum value of the pushable chromatic number is 6 or 7. We also prove that the maximum value of the pushable chromatic number of oriented graphs with maximum average degree less than 3 lies between 5 and 6. The former upper bound of 7 also holds as an upper bound on the pushable chromatic number of planar oriented graphs with girth at least 6.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/29/2019

Oriented coloring of graphs with low maximum degree

Duffy et al. [C. Duffy, G. MacGillivray, and É. Sopena, Oriented colouri...
research
05/11/2021

Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√(n))

We study the problem of testing triangle freeness in the general graph m...
research
12/13/2018

Oriented Colourings of Graphs with Maximum Degree Three and Four

We show that any orientation of a graph with maximum degree three has an...
research
07/04/2019

Vector Colorings of Random, Ramanujan, and Large-Girth Irregular Graphs

We prove that in sparse Erdős-Rényi graphs of average degree d, the vect...
research
12/23/2019

On the Burning Number of p-Caterpillars

The burning number is a recently introduced graph parameter indicating t...
research
11/02/2022

Random Embeddings of Graphs: The Expected Number of Faces in Most Graphs is Logarithmic

A random 2-cell embedding of a connected graph G in some orientable surf...
research
06/19/2018

Defective and Clustered Choosability of Sparse Graphs

An (improper) graph colouring has "defect" d if each monochromatic subgr...

Please sign up or login with your details

Forgot password? Click here to reset