Group connectivity in 3-edge-connected graphs
type: Item
instance of: scholarly article
title: Group connectivity in 3-edge-connected graphs
zbMATH Open document ID: 1256.05135
author: Fan Yang
author: Xiangwen Li
published in: Graphs and Combinatorics
publication date: 2012-12-27T00:00:00Z
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C25
zbMATH DE Number: 6118536
zbMATH Keywords: nowhere-zero flows
zbMATH Keywords: group connectivity
zbMATH Keywords: super-Eulerian graphs
MaRDI profile type: Publication
full work available at URL: s00373-011-1067-5
OpenAlex ID: W1978975094
cites work: Q3097395
cites work: A note on minimum degree conditions for supereulerian graphs
cites work: A reduction method to find spanning Eulerian subgraphs
cites work: Graphs without spanning closed trails
cites work: Super-Eulerian graphs of minimum degree at least \(4\).
cites work: Q3983243
cites work: Flows and generalized coloring theorems in graphs
cites work: Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
cites work: Extending a partial nowhere-zero 4-flow
cites work: Group connectivity of 3-edge-connected chordal graphs
cites work: Eulerian subgraphs and Hamilton-connected line graphs
cites work: The supereulerian graphs in the graph family \(C(l,k)\)
cites work: Decomposition of Finite Graphs Into Forests
cites work: A Contribution to the Theory of Chromatic Polynomials
cites work: On the algebraic theory of graph colorings
cites work: Degree conditions for group connectivity
DOI: 10.1007/S00373-011-1067-5
description: scientific article; zbMATH DE number 6118536