✦ LIBER ✦

Flows and generalized coloring theorems in graphs

✍ Scribed by F Jaeger

Book ID: 107884105
Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 790 KB
Volume: 26
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(79)90057-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Antisymmetric flows and strong oriented

Antisymmetric flows and strong oriented coloring of planar graphs

✍ Robert S̆ámal 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 190 KB

NeÄ setÄ ril and Raspaud (Ann. Inst. Fourier 49 (3) (1999) 1037-1056) deÿned antisymmetric ow, which is a variant of nowhere zero ow, and a dual notion to strong oriented coloring. We give an upper bound on the number of colors needed for a strong oriented coloring of a planar graph, and hereby we ÿ

Generic automorphisms and graph coloring

✍ James H. Schmerl 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Brooks' graph-coloring theorem and the i

Brooks' graph-coloring theorem and the independence number

✍ Paul A Catlin 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 397 KB

Graph colorings, flows and arithmetic Tu

Graph colorings, flows and arithmetic Tutte polynomial

✍ DʼAdderio, Michele; Moci, Luca 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 325 KB

Coloring infinite graphs and the Boolean

Coloring infinite graphs and the Boolean prime ideal theorem

✍ H. Läuchli 📂 Article 📅 1971 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 326 KB

A generalization of edge-coloring in gra

A generalization of edge-coloring in graphs

✍ S. Louis Hakimi; Oded Kariv 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 754 KB

Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex u at most m(u) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(u) = 1 for all