Edge Colorings and Circular Flow Numbers of Regular Graphs

DOI10.1002/jgt.21809zbMath1312.05057arXiv1310.8441OpenAlexW3121863720WikidataQ114236171 ScholiaQ114236171MaRDI QIDQ5251196

Eckhard Steffen

Publication date: 22 May 2015

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

Full work available at URL: https://arxiv.org/abs/1310.8441

zbMATH Keywords

regular graphscircular flows3-flow conjectureedge-coloringscircular flow conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Flows in graphs (05C21)

Related Items (2)

The Flow Index of Regular Class I Graphs ⋮ Edge colorings and circular flows on regular graphs

Cites Work

• Unnamed Item
• Circular flow numbers of regular multigraphs
• Balanced Valuations and Flows in Multigraphs
• On (k,d)-colorings and fractional nowhere-zero flows
• Chromatic-index-critical graphs of even order
• Construction of graphs with given circular flow numbers
• A theorem on three-coloring the edges of a trivalent graph
• On the Imbedding of Linear Graphs in Surfaces
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Edge Colorings and Circular Flow Numbers of Regular Graphs