Spanning triangle-trees and flows of graphs

DOI10.1007/S00373-020-02220-6MaRDI QIDQ2657050zbMATH OpenOpenAlexFDO

Authors Jiaao Li, Xueliang Li, MeiLing Wang

Publication date 17 March 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

2-tree3-flow flow indexnowhere-zero flowtriangle-treetriangularly-connected

Mathematics Subject Classification ID

Trees (05C05) Flows in graphs (05C21) Connectivity (05C40)

Abstract: In this paper we study the flow-property of graphs containing a spanning triangle-tree. Our main results provide a structure characterization of graphs with a spanning triangle-tree admitting a nowhere-zero $3$-flow. All these graphs without nowhere-zero $3$-flows are constructed from $K_4$ by a so-called bull-growing operation. This generalizes a result of Fan et al. in 2008 on triangularly-connected graphs and particularly shows that every $4$-edge-connected graph with a spanning triangle-tree has a nowhere-zero $3$-flow. A well-known classical theorem of Jaeger in 1979 shows that every graph with two edge-disjoint spanning trees admits a nowhere-zero $4$-flow. We prove that every graph with two edge-disjoint spanning triangle-trees has a flow strictly less than $3$.

Recommendations

• Nowhere-zero 3-flows in triangularly connected graphs
• \({\mathbb{Z}_3}\)-connectivity of 4-edge-connected triangular graphs
• Nowhere-zero unoriented 6-flows on certain triangular graphs
• Extending a partial nowhere-zero 4-flow
• Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• An equivalent version of the 3-flow conjecture
• Beautiful conjectures in graph theory
• Claw‐decompositions and tutte‐orientations
• Complementary graphs with flows less than three
• Counterexamples to Jaeger's circular flow conjecture
• Flows and generalized coloring theorems in graphs
• Graph theory
• Group connectivity and group colorings of graphs --- a survey
• Group connectivity of 3-edge-connected chordal graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero 3-flows in squares of graphs
• Nowhere-zero 3-flows in triangularly connected graphs
• Nowhere‐zero 3‐flows in locally connected graphs
• On (k,d)-colorings and fractional nowhere-zero flows
• On group connectivity of graphs
• Planar 4-critical graphs with four triangles
• The flow index and strongly connected orientations
• The weak 3-flow conjecture and the weak circular flow conjecture

Cited in

(6)

• Transforming spanning trees and pseudo-triangulations
• On the spanning tree polyhedron
• Nowhere-zero unoriented 6-flows on certain triangular graphs
• Extending a partial nowhere-zero 4-flow
• Spanning triangulations in graphs
• Integer flows on triangularly connected signed graphs

This page was built for publication: Spanning triangle-trees and flows of graphs

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