All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected
type: Item
instance of: scholarly article
title: All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected
zbMATH Open document ID: 1234.05143
author: Takuro Fukunaga
published in: Graphs and Combinatorics
publication date: 2012-01-24T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C21
zbMATH DE Number: 5999860
zbMATH Keywords: Edge-connectivity
zbMATH Keywords: HHD-free graph
zbMATH Keywords: Nowhere-zero flow
zbMATH Keywords: \({\mathbb{Z}}_3\)-connectivity
MaRDI profile type: Publication
full work available at URL: s00373-010-0995-9
OpenAlex ID: W2009045308
cites work: Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
cites work: On the algebraic theory of graph colorings
cites work: An equivalent version of the 3-flow conjecture
cites work: Q4871752
cites work: Nowhere‐zero 3‐flows in locally connected graphs
cites work: Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected
cites work: Group connectivity of 3-edge-connected chordal graphs
cites work: Nowhere-zero 3-flows in triangularly connected graphs
cites work: On rigid circuit graphs
cites work: On the semi-perfect elimination
DOI: 10.1007/S00373-010-0995-9
description: scientific article; zbMATH DE number 5999860