DeepAI AI Chat
Log In Sign Up

Union vertex-distinguishing edge colorings

by   Teeradej Kittipassorn, et al.
Chulalongkorn University

The union vertex-distinguishing chromatic index χ'_∪(G) of a graph G is the smallest natural number k such that the edges of G can be assigned nonempty subsets of [k] so that the union of the subsets assigned to the edges incident to each vertex is different. We prove that χ'_∪(G) ∈{⌈log_2(n +1) ⌉, ⌈log_2(n +1) ⌉+1 } for a graph G on n vertices without a component of order at most two. This answers a question posed by Bousquet, Dailly, Duchêne, Kheddouci and Parreau, and independently by Chartrand, Hallas and Zhang.


page 1

page 2

page 3

page 4


A note on the neighbour-distinguishing index of digraphs

In this note, we introduce and study a new version of neighbour-distingu...

Constant Arboricity Spectral Sparsifiers

We show that every graph is spectrally similar to the union of a constan...

Reconfiguration of the Union of Arborescences

An arborescence in a digraph is an acyclic arc subset in which every ver...

A Note on Robust Subsets of Transversal Matroids

Robust subsets of matroids were introduced by Huang and Sellier to propo...

A maximizing characteristic for critical configurations of chip-firing games on digraphs

Aval et al. proved that starting from a critical configuration of a chip...

Distinguishing numbers and distinguishing indices of oriented graphs

A distinguishing r-vertex-labelling (resp. r-edge-labelling) of an undir...

Temporal Cliques admit Sparse Spanners

Let G=(G,λ) be a labeled graph on n vertices with λ:E_G→N a locally inj...