Some degree and forbidden subgraph conditions for a graph to have a \(k\)-contractible edge

DOI10.1016/j.disc.2015.07.016zbMath1322.05042OpenAlexW1909550983MaRDI QIDQ501049

Kiyoshi Ando

Publication date: 8 October 2015

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

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

zbMATH Keywords

forbidden subgraph\(k\)-connected graphcontractible edge

Mathematics Subject Classification ID

Connectivity (05C40) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

$K_5^-$-Subdivision in 4-Connected Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractible edges in \(k\)-connected graphs with some forbidden subgraphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
• Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge
• A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
• A new degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
• Nonseparating cycles inK-Connected graphs

This page was built for publication: Some degree and forbidden subgraph conditions for a graph to have a \(k\)-contractible edge