Graphic sequences with an \(A\)-connected realization

DOI10.1007/s00373-013-1363-3zbMath1306.05134OpenAlexW1970749935MaRDI QIDQ489330

Rong Luo, Guodong Guo, Jian Hua Yin

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1363-3

zbMATH Keywords

graphic sequencegroup connectivity\(A\)-connected realization

Mathematics Subject Classification ID

Connectivity (05C40) Vertex degrees (05C07)

Related Items (5)

An extremal problem on bigraphic pairs with an \(A\)-connected realization ⋮ Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization ⋮ Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees ⋮ Bigraphic pairs with an \(A\)-connected realization ⋮ The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization

Cites Work

• Unnamed Item
• An extremal problem on group connectivity of graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of 3-edge-connected chordal graphs
• The smallest degree sum that yields graphic sequences with a \(Z_3\)-connected realization
• Group connectivity and group colorings of graphs --- a survey
• Algorithms for constructing graphs and digraphs with given valences and factors
• Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
• Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows

This page was built for publication: Graphic sequences with an \(A\)-connected realization