Combinatorica

, Volume 12, Issue 2, pp 125–134

Colorings and orientations of graphs

  • N. Alon
  • M. Tarsi
Article

DOI: 10.1007/BF01204715

Cite this article as:
Alon, N. & Tarsi, M. Combinatorica (1992) 12: 125. doi:10.1007/BF01204715

Abstract

Bounds for the chromatic number and for some related parameters of a graph are obtained by applying algebraic techniques. In particular, the following result is proved: IfG is a directed graph with maximum outdegreed, and if the number of Eulerian subgraphs ofG with an even number of edges differs from the number of Eulerian subgraphs with an odd number of edges then for any assignment of a setS(v) ofd+1 colors for each vertexv ofG there is a legal vertex-coloring ofG assigning to each vertexv a color fromS(v).

AMS Subject Classification codes (1991)

05 C 1505 C 20

Copyright information

© Akadémiai Kiadó 1992

Authors and Affiliations

  • N. Alon
    • 1
  • M. Tarsi
    • 2
  1. 1.Department of Pure Mathematics School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact SciencesTel Aviv UniversityTel AvivIsrael
  2. 2.Department of Computer Science School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact SciencesTel Aviv UniversityTel AvivIsrael