Abstract
In 1966 T. Gallai asked whether every criticalk-chromatic graph possesses an orientation having just one directed path of lengthk−1. In this note we show that in general the answer is negative, but also that the answer is affirmative whenk≥5 and the graph has maximal degree at mostk.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
C. Berge:La Théorie des Graphes et ses Applications, Dunod, Paris, (1958).
O. V. Borodin, andA. V. Kostochka: On an Upper Bound of a Graph's Chromatic Number, Depending on the Graph's Degree and Density,J. Comb. Theory B 23, (1977), 247–250.
P. A. Catlin: Hajós' Graph Colouring Conjecture: Variations and Counterexamples,J. Comb. Theory (B),26, (1979), 268–274.
T. Gallai: On Directed Paths and Circuits,Theory of Graphs (eds. P. Erdős, G. Katona), Academic Press, New York, (1968), 115–118.
M. Las Vergnas: Sur les circuits dans les sommes compl'et'ees de graphes orient'es,Cahiers du Centre d'Etudes de Recherche Op'erationelle,15 (1973), 231–244.
Toft: 75 Graph Coluring Problems,Graph Colourings (eds. R. Nelson, R. Wilson), Pitman Res. Notes,218, Longman (1990), 9–35.