Spanning triangle-trees and flows of graphs
From MaRDI portal
Publication:2657050
DOI10.1007/s00373-020-02220-6zbMath1459.05108arXiv1910.05058OpenAlexW3049315800MaRDI QIDQ2657050
Jiaao Li, MeiLing Wang, Xue Liang Li
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
Cites Work
- Unnamed Item
- Unnamed Item
- The weak 3-flow conjecture and the weak circular flow conjecture
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Planar 4-critical graphs with four triangles
- Nowhere-zero 3-flows in triangularly connected graphs
- On group connectivity of graphs
- Flows and generalized coloring theorems in graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of 3-edge-connected chordal graphs
- The flow index and strongly connected orientations
- Counterexamples to Jaeger's circular flow conjecture
- An equivalent version of the 3-flow conjecture
- Nowhere-zero 3-flows in squares of graphs
- Complementary graphs with flows less than three
- Group connectivity and group colorings of graphs --- a survey
- Beautiful conjectures in graph theory
- On (k,d)-colorings and fractional nowhere-zero flows
- Nowhere‐zero 3‐flows in locally connected graphs
- Claw‐decompositions and tutte‐orientations
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: Spanning triangle-trees and flows of graphs