The Chvátal-Erdős condition for group connectivity in graphs
From MaRDI portal
Publication:2014729
DOI10.1007/s00373-013-1288-xzbMath1293.05198OpenAlexW2015579149MaRDI QIDQ2014729
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Degree condition and \(Z_3\)-connectivity
- Degree sum condition for \(Z_{3}\)-connectivity in graphs
- Ore-condition and \(Z_3\)-connectivity
- Degree conditions for group connectivity
- Smallest counterexample to the 5-flow conjecture has girth at least eleven
- The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
- Degree sum and nowhere-zero 3-flows
- Flows and generalized coloring theorems in graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Supereulerian graphs, independent sets, and degree-sum conditions
- Group connectivity of 3-edge-connected chordal graphs
- Group connectivity and group colorings of graphs --- a survey
- A note on Hamiltonian circuits
- Ore Condition and Nowhere-Zero 3-Flows
- A reduction method to find spanning Eulerian subgraphs
- Extending a partial nowhere-zero 4-flow
- Nowhere‐zero 3‐flows in locally connected graphs
- On the algebraic theory of graph colorings
- A Contribution to the Theory of Chromatic Polynomials
This page was built for publication: The Chvátal-Erdős condition for group connectivity in graphs
