A theorem on three-coloring the edges of a trivalent graph

From MaRDI portal

Revision as of 03:57, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5603838

Jump to:navigation, search

DOI10.1016/S0021-9800(67)80097-8zbMath0203.56701MaRDI QIDQ5603838

George J. Minty

Publication date: 1967

Published in: Journal of Combinatorial Theory (Search for Journal in Brave)

Related Items (6)

Flows and generalized coloring theorems in graphs ⋮ Unnamed Item ⋮ Diagrams, orientations, and varieties ⋮ Balanced Valuations and Flows in Multigraphs ⋮ Edge Colorings and Circular Flow Numbers of Regular Graphs ⋮ Polynomials associated with nowhere-zero flows

This page was built for publication: A theorem on three-coloring the edges of a trivalent graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5603838&oldid=30258378"