The interleaved multichromatic number of a graph
From MaRDI portal
Abstract: For , we consider interleaved -tuple colorings of the nodes of a graph, that is, assignments of distinct natural numbers to each node in such a way that nodes that are connected by an edge receive numbers that are strictly alternating between them with respect to the relation . If it takes at least distinct numbers to provide graph with such a coloring, then the interleaved multichromatic number of is and is known to be given by a function of the simple cycles of under acyclic orientations if is connected [1]. This paper contains a new proof of this result. Unlike the original proof, the new proof makes no assumptions on the connectedness of , nor does it resort to the possible applications of interleaved -tuple colorings and their properties.
Recommendations
Cited in
(4)
This page was built for publication: The interleaved multichromatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400779)