On circular flows of graphs
From MaRDI portal
Publication:2460626
DOI10.1007/s00493-007-0055-0zbMath1135.05308OpenAlexW1981888770WikidataQ126263789 ScholiaQ126263789MaRDI QIDQ2460626
Cun-Quan Zhang, Rui Xu, Hong-Jian Lai
Publication date: 12 November 2007
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-007-0055-0
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items
Packing spanning trees in highly essentially connected graphs ⋮ Spectral radius and edge‐disjoint spanning trees ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations
This page was built for publication: On circular flows of graphs