A strong Pósa condition for a graphic list to be forcibly \(Z_3\)-connected

DOI10.1016/J.DISC.2013.01.017zbMath1262.05074OpenAlexW2009170332MaRDI QIDQ1946661

Yue Zhang, Jian Hua Yin

Publication date: 15 April 2013

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

Full work available at URL: https://doi.org/10.1016/j.disc.2013.01.017

zbMATH Keywords

group connectivityforcibly \(Z_3\)-connected graphic listthe Pósa condition

Mathematics Subject Classification ID

Connectivity (05C40) Flows in graphs (05C21)

Related Items (1)

Group connectivity of graphs satisfying the Chvátal-condition

This page was built for publication: A strong Pósa condition for a graphic list to be forcibly \(Z_3\)-connected