Ore-condition and \(Z_3\)-connectivity

From MaRDI portal
Publication:942129

DOI10.1016/J.EJC.2007.11.014zbMath1171.05029OpenAlexW2039100101MaRDI QIDQ942129

Gexin Yu, Rui Xu, Rong Luo, Jian Hua Yin

Publication date: 4 September 2008

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.11.014




Related Items (34)

\(Z_3\)-connectivity of claw-free graphsAn extremal problem on bigraphic pairs with an \(A\)-connected realizationNowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphsNeighborhood unions and \(Z_3\)-connectivity in graphsNowhere-zero 3-flows of graphs with independence number twoTwo equivalent properties of \(\mathcal Z_3\)-connectivityDegree sum of a pair of independent edges and \(Z_{3}\)-connectivityGroup connectivity of bridged graphsNowhere-zero 3-flow of graphs with small independence numberDegree 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 graphsA note on an extremal problem for group-connectivityGroup connectivity of graphs satisfying the Chvátal-condition\(Z_3\)-connectivity of wreath product of graphsOn dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphsDegree condition and \(Z_3\)-connectivityContractible graphs for flow index less than threeGroup connectivity and group colorings of graphs --- a surveyAn extremal problem on group connectivity of graphsNowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphsNowhere-zero 3-flows and modulo \(k\)-orientationsThe sum necessary to ensure that a degree sequence pair has an \(a\)-connected realizationPósa-condition and nowhere-zero 3-flowsDegree conditions for group connectivityThe Chvátal-Erdős condition for group connectivity in graphsDegree sum condition for \(Z_{3}\)-connectivity in graphsNowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphsFlow-contractible configurations and group connectivity of signed graphs\(Z_3\)-connectivity with independent number 2Nowhere-zero 3-flows of claw-free graphsMaximum degree condition and group connectivityEVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTEDGroup connectivity and matchings




Cites Work




This page was built for publication: Ore-condition and \(Z_3\)-connectivity