Single-conflict colorings of degenerate graphs

12/12/2021
by   Peter Bradshaw, et al.
0

We consider single-conflict colorings, a variant of graph colorings in which each edge of a graph has a single forbidden color pair. We show that for any assignment of forbidden color pairs to the edges of a d-degenerate graph G on n vertices of edge-multiplicity at most loglog n, O(√( d )log n) colors are always enough to color the vertices of G in a way that avoids every forbidden color pair. This answers a question of Dvořák, Esperet, Kang, and Ozeki for simple graphs (Journal of Graph Theory 2021).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2018

Conflict-free connections: algorithm and complexity

A path in an(a) edge(vertex)-colored graph is called a conflict-free pat...
research
03/12/2020

Conflict-free coloring on closed neighborhoods of bounded degree graphs

The closed neighborhood conflict-free chromatic number of a graph G, den...
research
02/26/2019

On Ramsey numbers of hedgehogs

The hedgehog H_t is a 3-uniform hypergraph on vertices 1,...,t+t2 such t...
research
10/19/2018

On the complexity of color-avoiding site and bond percolation

The mathematical analysis of robustness and error-tolerance of complex n...
research
09/27/2021

Classifying Dyads for Militarized Conflict Analysis

Understanding the origins of militarized conflict is a complex, yet impo...
research
11/17/2019

Dense Color Constancy with Effective Edge Augmentation

Recently, computational color constancy via convolutional neural network...
research
02/12/2021

Edge Minimizing the Student Conflict Graph

In many schools, courses are given in sections. Prior to timetabling stu...

Please sign up or login with your details

Forgot password? Click here to reset