Relations between the local chromatic number and its directed version

DOI10.1002/JGT.21834zbMATH Open1316.05049arXiv1305.7473OpenAlexW1953211229MaRDI QIDQ5265337FDOQ5265337

Authors: Gábor Simonyi, Gábor Tardos, Ambrus Zsbán 

Publication date: 23 July 2015

Published in: Journal of Graph Theory (Search for Journal in Brave)

Abstract: The local chromatic number is a coloring parameter defined as the minimum number of colors that should appear in the most colorful closed neighborhood of a vertex under any proper coloring of the graph. Its directed version is the same when we consider only outneighborhoods in a directed graph. For digraphs with all arcs being present in both directions the two values are obviously equal. Here we consider oriented graphs. We show the existence of a graph where the directed local chromatic number of all oriented versions of the graph is strictly less than the local chromatic number of the underlying undirected graph. We show that for fractional versions the analogous problem has a different answer: there always exists an orientation for which the directed and undirected values coincide. We also determine the supremum of the possible ratios of these fractional parameters, which turns out to be e, the basis of the natural logarithm.

Full work available at URL: https://arxiv.org/abs/1305.7473

Recommendations

• On directed local chromatic number, shift graphs, and Borsuk-like graphs
• On fractional version of oriented coloring
• Local chromatic number and Sperner capacity
• Dichromatic number and fractional chromatic number
• Coloring tournaments: from local to global

zbMATH Keywords

oriented graphslocal chromatic numberfractional colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Coloring graphs with locally few colors
• The dichromatic number of a digraph
• Local chromatic number and Sperner capacity
• On directed local chromatic number, shift graphs, and Borsuk-like graphs
• Title not available (Why is that?)
• Capacities: From information theory to extremal set theory
• Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities

Cited In (2)

• On fractional version of oriented coloring
• On directed local chromatic number, shift graphs, and Borsuk-like graphs

This page was built for publication: Relations between the local chromatic number and its directed version

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5265337)