A complete characterization of graphic sequences with a Z₃-connected realization

DOI10.1016/J.EJC.2015.05.008zbMATH Open1321.05055OpenAlexW971943233MaRDI QIDQ499463FDOQ499463

Authors Xiang-Yu Dai, Jian-Hua Yin

Publication date 30 September 2015

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2015.05.008

zbMATH Keywords

cyclic group of order three

Mathematics Subject Classification ID

Vertex degrees (05C07) Connectivity (05C40)

Recommendations

• Realizing degree sequences as \(Z_3\)-connected graphs
• The smallest degree sum that yields graphic sequences with a \(Z_3\)-connected realization
• Graphic sequences with an \(A\)-connected realization
• Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
• A strong Pósa condition for a graphic list to be forcibly \(Z_3\)-connected

Cites work

• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• A note on an extremal problem for group-connectivity
• Algorithms for constructing graphs and digraphs with given valences and factors
• An extremal problem on group connectivity of graphs
• An extremal problem on potentially \(K_{r,s}\)-graphic sequences
• Degree sum condition for \(Z_{3}\)-connectivity in graphs
• Graph theory
• Group connectivity and group colorings of graphs --- a survey
• Group connectivity of 3-edge-connected chordal graphs
• Group connectivity of certain graphs
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
• Realizing degree sequences as \(Z_3\)-connected graphs

Cited in

(10)

• scientific article; zbMATH DE number 7403609 (Why is no real title available?)
• Realizing degree sequences as \(Z_3\)-connected graphs
• Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
• An extremal problem on bigraphic pairs with an \(A\)-connected realization
• The smallest degree sum that yields graphic sequences with a \(Z_3\)-connected realization
• Solution to an extremal problem on bigraphic pairs with a \(Z_3\)-connected realization
• Bigraphic pairs with an \(A\)-connected realization
• Graphic sequences with an \(A\)-connected realization
• Modulo 5-orientations and degree sequences
• A strong Pósa condition for a graphic list to be forcibly \(Z_3\)-connected

This page was built for publication: A complete characterization of graphic sequences with a \(Z_3\)-connected realization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499463)