Nowhere-zero 3-flows in triangularly connected graphs

From MaRDI portal
Publication:958692

DOI10.1016/j.jctb.2008.02.008zbMath1171.05026OpenAlexW2152194798MaRDI QIDQ958692

Chuixiang Zhou, Rui Xu, Hong-Jian Lai, Cun-Quan Zhang, Geng-Hua Fan

Publication date: 8 December 2008

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2008.02.008




Related Items (34)

\(Z_3\)-connectivity of claw-free graphsExtendability of contractible configurations for nowhere-zero flows and modulo orientationsNowhere-zero 3-flows of graphs with independence number twoTwo equivalent properties of \(\mathcal Z_3\)-connectivityGroup connectivity of bridged graphsSpanning triangle-trees and flows of graphsDegree sum of 3 independent vertices and \(Z_3\)-connectivityA note on \(Z_3\)-connected graphs with degree sum conditionRealizing degree sequences as \(Z_3\)-connected graphs\(Z_3\)-connectivity of wreath product of graphsGroup connectivity and group colorings of graphs --- a surveyNowhere-zero 3-flows in matroid base graphAn extremal problem on group connectivity of graphsA dual version of the brooks group coloring theoremGroup connectivity in line graphsNowhere-zero flows on signed wheels and signed fansNowhere-zero 3-flows and modulo \(k\)-orientations\(Z_3\)-connectivity of 4-edge-connected 2-triangular graphsAll 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connectedEquivalent versions of group-connectivity theorems and conjecturesOre-condition and \(Z_3\)-connectivityA note on the inducibility of 4-vertex graphsGroup chromatic number of Halin graphsPósa-condition and nowhere-zero 3-flowsDegree sum condition for \(Z_{3}\)-connectivity in graphsNowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphsNZ-flows in strong products of graphsDegree sum and nowhere-zero 3-flows\(Z_3\)-connectivity with independent number 2Nowhere-zero 3-flows of claw-free graphsNote on cycle double covers of graphsEVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTEDColoring drawings of graphsGroup connectivity in \(J_3\) line graphs



Cites Work


This page was built for publication: Nowhere-zero 3-flows in triangularly connected graphs