Chromatic Polynomials of Oriented Graphs

10/12/2018
by   Danielle Cox, et al.
0

The oriented chromatic polynomial of a oriented graph outputs the number of oriented k-colourings for any input k. We fully classify those oriented graphs for which the oriented graph has the same chromatic polynomial as the underlying simple graph, closing an open problem posed by Sopena. We find that such oriented graphs admit a forbidden subgraph characterization, and such graphs can be both identified and constructed in polynomial time. We study the analytic properties of this polynomial and show that there exist oriented graphs which have chromatic polynomials have roots, including negative real roots, that cannot be realized as the root of any chromatic polynomial of a simple graph.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2021

On Deeply Critical Oriented Cliques

In this work we consider arc criticality in colourings of oriented graph...
research
08/23/2022

Homomorphically Full Oriented Graphs

Homomorphically full graphs are those for which every homomorphic image ...
research
04/18/2020

Convex Hulls and Simple Colourings in Directed and 2-edge-Coloured Graphs

An oriented graph (2-edge-coloured graph) is complete convex when the co...
research
11/15/2018

A study of cops and robbers in oriented graphs

We consider the well-studied cops and robbers game in the context of ori...
research
11/15/2018

Cops and robbers on oriented graphs

We consider the well-studied cops and robbers game in the context of ori...
research
03/17/2022

Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching

We resolve an open question by Woeginger [Open Problem 13, SOFSEM '13] r...
research
12/25/2017

Topological Representation of the Transit Sets of k-Point Crossover Operators

k-point crossover operators and their recombination sets are studied fro...

Please sign up or login with your details

Forgot password? Click here to reset