Modulo 5-orientations and degree sequences

DOI10.1016/j.dam.2019.01.021zbMath1409.05096OpenAlexW2912763084WikidataQ128360667 ScholiaQ128360667MaRDI QIDQ1741509

Hong-Jian Lai, Miaomiao Han, Jian-Bing Liu

Publication date: 3 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.01.021

zbMATH Keywords

nowhere-zero flowsgraphic sequencesdegree sequence realizationsgroup-connectivitymodulo orientations

Mathematics Subject Classification ID

Vertex degrees (05C07) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• Realizing degree sequences as \(Z_3\)-connected graphs
• On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
• A note on an extremal problem for group-connectivity
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• A complete characterization of graphic sequences with a \(Z_3\)-connected realization
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of 3-edge-connected chordal graphs
• Counterexamples to Jaeger's circular flow conjecture
• Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
• Mod (2p + 1)-Orientations and $K_{1,2p+1}$-Decompositions
• Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Line removal algorithms for graphs and their degree lists
• Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Modulo 5-orientations and degree sequences