Local structure of 7- and 8-connected graphs

DOI10.1007/S10958-011-0615-0zbMATH Open1402.05116OpenAlexW2073091595MaRDI QIDQ2256706FDOQ2256706

Authors: S. A. Obraztsova, A. V. Pastor 

Publication date: 20 February 2015

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-011-0615-0

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Cites Work

• Vertices of degree 6 in a contraction critically 6-connected graph
• A recursive characterization of the 4-connected graphs
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A theorem on n-connected graphs
• The number of vertices of degree 7 in a contraction-critical 7-connected graph
• Nonseparating cycles inK-Connected graphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
• A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
• A local structure theorem on 5-connected graphs
• Title not available (Why is that?)
• Some properties of contraction-critical 5-connected graphs
• Contractible edges in 7-connected graphs
• Title not available (Why is that?)

Cited In (1)

• On local structure of 9- and 10-connected graphs

This page was built for publication: Local structure of 7- and 8-connected graphs

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