A note on the Gallai---Roy---Vitaver theorem

Authors:
Gerard J. Chang;Li-Da Tong;Jing-Ho Yan;Hong-Gwa Yeh
Affiliations:
Department of Mathematics, National Taiwan University, Taipei 106, Taiwan;Department of Applied Mathematics, National Sun Yet-sen University, Kaohsiung 804, Taiwan;Department of Mathematics, Aletheia University, Tamsui 251, Taiwan;Department of Applied Mathematics, National University of Kaoshiung, Kaohsiung 811, Taiwan
Venue:
Discrete Mathematics
Year:
2002

Citing 0
Cited 2

Effect of Si capping layer on the interface quality and NBTI of high mobility channel Ge-on-Si pMOSFETs

Microelectronic Engineering
On a generalization of the Gallai-Roy-Vitaver theorem to the bandwidth coloring problem

Operations Research Letters

Quantified Score

Hi-index	0.05

Visualization

Abstract

The well-known theorem by Gallai-Roy-Vitaver says that every digraph G has a directed path with at least χ(G) vertices; hence this holds also for graphs. Li strengthened the digraph result by showing that the directed path can be constrained to start from any vertex that can reach all others. For a graph G given a proper χ(G)-coloring, he proved that the path can be required to start at any vertex and visit vertices of all colors. We give a shorter proof of this. He conjectured that the same holds for digraphs; we provide a strongly connected counterexample. We also give another extension of the Gallai-Roy-Vitaver Theorem on graphs.