Contractible edges in k-connected graphs with some forbidden subgraphs

DOI10.1007/S00373-013-1358-0MaRDI QIDQ489329zbMATH OpenOpenAlexFDO

Authors Yingqiu Yang, Liang Sun

Publication date 20 January 2015

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-013-1358-0

zbMATH Keywords

\(k\)-connected graphcontractible edgefragmentminimum fragment

Mathematics Subject Classification ID

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

Recommendations

• Contractible edges in some \(k\)-connected graphs.
• Contractible edges in minimally \(k\)-connected graphs
• \(k\)-connected graphs without \(K_4^-\).
• \(k\)-contractible edges in \(k\)-connected graphs not containing some specified graphs
• scientific article; zbMATH DE number 1530019

Cites work

• scientific article; zbMATH DE number 3600073 (Why is no real title available?)
• scientific article; zbMATH DE number 7491867 (Why is no real title available?)
• scientific article; zbMATH DE number 2188449 (Why is no real title available?)
• 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 -connected graph
• Contractible edges and triangles in k-connected graphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
• Contractible edges in minimally \(k\)-connected graphs
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Generalizaions of critical connectivity of graphs
• Graph theory with applications
• Nonseparating cycles inK-Connected graphs
• Note on \(k\)-contractible edges in \(k\)-connected graphs
• Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge
• Trivially noncontractible edges in a contraction critically 5-connected graph
• Uncontractable 4-connected graphs
• Vertices of degree 5 in a contraction critically 5-connected graph
• \(k\)-contractible edges in \(k\)-connected graphs not containing some specified graphs

Cited in

(15)

• \(k\)-contractible edges in \(k\)-connected graphs not containing some specified graphs
• A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
• Contractible edges in some \(k\)-connected graphs.
• \(k\)-connected graphs without \(K_4^-\).
• Contractible edges in minimally \(k\)-connected graphs
• Note on \(k\)-contractible edges in \(k\)-connected graphs
• Contractible subgraphs ink-connected graphs
• \(K_5^-\)-subdivision in 4-connected graphs
• Contraction Blockers for Graphs with Forbidden Induced Paths
• Contractible elements ink-connected graphs not containing some specified graphs
• A new forbidden pair for 6-contractible edges
• scientific article; zbMATH DE number 139920 (Why is no real title available?)
• scientific article; zbMATH DE number 1530019 (Why is no real title available?)
• Some degree and forbidden subgraph conditions for a graph to have a \(k\)-contractible edge
• A new forbidden subgraph for 5-contractible edges

This page was built for publication: Contractible edges in \(k\)-connected graphs with some forbidden subgraphs

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