The Chvátal-Erdős condition for group connectivity in graphs

DOI10.1007/S00373-013-1288-XzbMATH Open1293.05198OpenAlexW2015579149MaRDI QIDQ2014729FDOQ2014729

Authors Xiaoxia Zhang, Xiangwen Li 

Publication date 16 June 2014

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

Full work available at URL https://doi.org/10.1007/s00373-013-1288-x

zbMATH Keywords

group connectivitysupereuleriannowhere-zero 4-flowsChvátal-Erdős condition

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Degree conditions for group connectivity
• Group connectivity of two kinds of graphs
• Group connectivity of certain graphs
• Group connectivity in 3-edge-connected graphs
• Degree sum condition for \(Z_{3}\)-connectivity in graphs

Cites Work

• scientific article; zbMATH DE number 4055653 (Why is no real title available?)
• scientific article; zbMATH DE number 26482 (Why is no real title available?)
• A Contribution to the Theory of Chromatic Polynomials
• A note on Hamiltonian circuits
• A reduction method to find spanning Eulerian subgraphs
• Degree condition and \(Z_3\)-connectivity
• Degree conditions for group connectivity
• Degree sum and nowhere-zero 3-flows
• Degree sum condition for \(Z_{3}\)-connectivity in graphs
• Extending a partial nowhere-zero 4-flow
• Flows and generalized coloring theorems in graphs
• Graph theory with applications
• Group connectivity and group colorings of graphs --- a survey
• Group connectivity of 3-edge-connected chordal graphs
• Group connectivity of certain graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Nowhere‐zero 3‐flows in locally connected graphs
• On the algebraic theory of graph colorings
• Ore Condition and Nowhere-Zero 3-Flows
• Ore-condition and \(Z_3\)-connectivity
• Smallest counterexample to the 5-flow conjecture has girth at least eleven
• Supereulerian graphs, independent sets, and degree-sum conditions
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index

Cited In (7)

• Group connectivity of graphs satisfying the Chvátal-condition
• An extremal problem on group connectivity of graphs
• Group connectivity and matchings
• Group connectivity of bridged graphs
• Title not available (Why is no real title available?)
• Group connectivity in 3-edge-connected graphs
• Title not available (Why is no real title available?)

This page was built for publication: The Chvátal-Erdős condition for group connectivity in graphs

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