The circular flow number of a 6-edge connected graph is less than four
type: Item
instance of: scholarly article
title: The circular flow number of a 6-edge connected graph is less than four
zbMATH Open document ID: 1006.05049
author: A. Galluccio
author: Luis Goddyn
published in: Combinatorica
publication date: 2003-02-18T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 1870518
zbMATH Keywords: circular flow number
MaRDI profile type: Publication
full work available at URL: s004930200025
OpenAlex ID: W2094094736
DOI: 10.1007/S004930200025
Recommended article: Circular flow number of highly edge connected signed graphs
Recommended article: Q4812915
Recommended article: On the number of edges in a minimum \(C_6\)-saturated graph
Recommended article: The Set of Circular Flow Numbers of Regular Graphs
Recommended article: Determining the circular flow number of a cubic graph
Recommended article: Circular edge-colorings of cubic graphs with girth six
Recommended article: Construction of graphs with given circular flow numbers
Recommended article: Edge Colorings and Circular Flow Numbers of Regular Graphs
Recommended article: Circular flow numbers of regular multigraphs
description: scientific article; zbMATH DE number 1870518