2
doi
10.1007/bf01204715
Colorings and orientations of graphs
2019-04-11T13:35
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).
1992-06
true
research_article
1992-06-01
en
https://scigraph.springernature.com/explorer/license/
http://link.springer.com/10.1007/BF01204715
125-134
articles
Mathematical Sciences
Pure Mathematics
0209-9683
Combinatorica
1439-6912
readcube_id
3e62763dd86501e8d1d328553c79574c0bb4fc90aacc3d8a4c367e35d310a8ad
Tarsi
M.
12
pub.1013095644
dimensions_id
Springer Nature - SN SciGraph project
Department of Computer Science School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel
Department of Pure Mathematics School of Mathematical Sciences Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel
Tel Aviv University
Alon
N.