DeepAI AI Chat
Log In Sign Up

Equitable tree-O(d)-coloring of d-degenerate graphs

by   Xin Zhang, et al.

An equitable tree-k-coloring of a graph is a vertex coloring on k colors so that every color class incudes a forest and the sizes of any two color classes differ by at most one.This kind of coloring was first introduced in 2013 and can be used to formulate the structure decomposition problem on the communication network with some security considerations. In 2015, Esperet, Lemoine and Maffray showed that every d-degenerate graph admits an equitable tree-k-coloring for every k≥ 3^d-1. Motivated by this result, we attempt to lower their exponential bound to a linear bound. Precisely, we prove that every d-degenerate graph G admits an equitable tree-k-coloring for every k≥α d provided that |G|≥βΔ(G), where (α,β)∈{(8,56), (9,26), (10,18), (11,15), (12,13), (13,12), (14,11), (15,10), (17,9), (20,8), (27,7), (52,6)}.


page 1

page 2

page 3

page 4


Equitable vertex arboricity of d-degenerate graphs

A minimization problem in graph theory so-called the equitable tree-colo...

Complexity of tree-coloring interval graphs equitably

An equitable tree-k-coloring of a graph is a vertex k-coloring such that...

On λ-backbone coloring of cliques with tree backbones in linear time

A λ-backbone coloring of a graph G with its subgraph (also called a back...

Ancestral Colorings of Perfect Binary Trees With Applications in Private Retrieval of Merkle Proofs

We introduce a novel tree coloring problem in which each node of a roote...

Deep Learning-based Hybrid Graph-Coloring Algorithm for Register Allocation

Register allocation, which is a crucial phase of a good optimizing compi...

Coloring Big Graphs with AlphaGoZero

We show that recent innovations in deep reinforcement learning can effec...

New bounds and constructions for neighbor-locating colorings of graphs

A proper k-coloring of a graph G is a neighbor-locating k-coloring if fo...