Circular flow number of highly edge connected signed graphs

DOI10.1016/J.JCTB.2014.12.002MaRDI QIDQ2343288zbMATH OpenOpenAlexFDO

Authors Xuding Zhu

Publication date 4 May 2015

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

circular flowcircular flow numberedge connectivitysigned graphs

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Connectivity (05C40)

Abstract: This paper proves that for any positive integer $k$, every essentially $(2k+1)$-unbalanced $(12k-1)$-edge connected signed graph has circular flow number at most $2+frac1k$.

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• Circular chromatic number: A survey
• Edge-Disjoint Spanning Trees of Finite Graphs
• Entire colouring of plane graphs
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero integral chains and flows in bidirected graphs
• Nowhere-zero integral flows on a bidirected graph
• On (k,d)-colorings and fractional nowhere-zero flows
• On flows in bidirected graphs
• On the Imbedding of Linear Graphs in Surfaces
• Recent developments in circular colouring of graphs
• The weak 3-flow conjecture and the weak circular flow conjecture

Cited in

(12)

• Flows in signed graphs with two negative edges
• Multiple weak 2-linkage and its applications on integer flows of signed graphs
• Flow-contractible configurations and group connectivity of signed graphs
• The circular flow number of a 6-edge connected graph is less than four
• Circular flow number of generalized Blanuša snarks
• Conformal decomposition of integral flows on signed graphs with outer-edges
• Flow number and circular flow number of signed cubic graphs
• Determining the flow numbers of signed Eulerian graphs
• Signed graphs: from modulo flows to integer-valued flows
• Integer flows and modulo orientations of signed graphs
• Circular flow on signed graphs
• \(\mathbb{Z}_3\)-connectivity of signed graphs with independence number at most two

This page was built for publication: Circular flow number of highly edge connected signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2343288)