Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows

DOI10.1137/070687372zbMath1168.05017OpenAlexW2151097361MaRDI QIDQ3629459

Wenan Zang, Rui Xu, Rong Luo, Cun-Quan Zhang

Publication date: 27 May 2009

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://researchrepository.wvu.edu/cgi/viewcontent.cgi?article=1306&context=faculty_publications

zbMATH Keywords

graphcharacterizationdegree sequenceinteger flow

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (17)

An extremal problem on bigraphic pairs with an \(A\)-connected realization ⋮ Nowhere-zero 3-flows of graphs with independence number two ⋮ Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization ⋮ Degree sum of 3 independent vertices and \(Z_3\)-connectivity ⋮ Realizing degree sequences as \(Z_3\)-connected graphs ⋮ A note on an extremal problem for group-connectivity ⋮ Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ An extremal problem on group connectivity of graphs ⋮ Bigraphic pairs with an \(A\)-connected realization ⋮ Degree sequences and graphs with disjoint spanning trees ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ Graphic sequences with an \(A\)-connected realization ⋮ A complete characterization of graphic sequences with a \(Z_3\)-connected realization ⋮ Modulo 5-orientations and degree sequences ⋮ Pósa-condition and nowhere-zero 3-flows ⋮ Maximum degree condition and group connectivity

This page was built for publication: Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows