The smallest degree sum that yields graphic sequences with a \(Z_3\)-connected realization

DOI10.1016/J.EJC.2013.01.001zbMath1260.05089OpenAlexW2088518022MaRDI QIDQ1943388

Guodong Guo, Jian Hua Yin

Publication date: 19 March 2013

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

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

zbMATH Keywords

\(A\)-connected realization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Related Items (6)

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 ⋮ Realizing degree sequences as \(Z_3\)-connected graphs ⋮ Bigraphic pairs with an \(A\)-connected realization ⋮ The sum necessary to ensure that a degree sequence pair has an \(a\)-connected realization ⋮ Graphic sequences with an \(A\)-connected realization

This page was built for publication: The smallest degree sum that yields graphic sequences with a \(Z_3\)-connected realization