Nowhere-zero 3-flows of graphs with independence number two
From MaRDI portal
Publication:2637735
DOI10.1007/s00373-012-1238-zzbMath1282.05057OpenAlexW2035526969MaRDI QIDQ2637735
Rong Luo, Rui Xu, Zheng-Ke Miao
Publication date: 14 February 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-012-1238-z
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Flows in graphs (05C21)
Related Items (3)
Modulo orientations with bounded independence number ⋮ Nowhere-zero 3-flow of graphs with small independence number ⋮ \(Z_3\)-connectivity with independent number 2
Cites Work
- Unnamed Item
- Unnamed Item
- Pósa-condition and nowhere-zero 3-flows
- Degree sum condition for \(Z_{3}\)-connectivity in graphs
- Ore-condition and \(Z_3\)-connectivity
- Nowhere-zero 3-flows in triangularly connected graphs
- Degree sum and nowhere-zero 3-flows
- Flows and generalized coloring theorems in graphs
- Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts
- A note on Hamiltonian circuits
- Ore Condition and Nowhere-Zero 3-Flows
- Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
This page was built for publication: Nowhere-zero 3-flows of graphs with independence number two