Construction of graphs with given circular flow numbers
From MaRDI portal
Publication:4422617
DOI10.1002/jgt.10124zbMath1038.05027OpenAlexW4251997028MaRDI QIDQ4422617
Publication date: 20 August 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10124
Related Items
A unified approach to construct snarks with circular flow number 5 ⋮ Asymptotic lower bounds on circular chromatic index of snarks ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ Superposition of snarks revisited ⋮ Snarks with given real flow numbers ⋮ The Set of Circular Flow Numbers of Regular Graphs ⋮ Edge Colorings and Circular Flow Numbers of Regular Graphs
Cites Work
This page was built for publication: Construction of graphs with given circular flow numbers