Induced paths in 5-connected graphs

DOI<52::AID-JGT5>3.0.CO;2-N 10.1002/1097-0118(200101)36:1<52::AID-JGT5>3.0.CO;2-NzbMath0977.05074OpenAlexW4253988918MaRDI QIDQ2708795

Matthias Kriesell

Publication date: 8 January 2002

Full work available at URL: https://doi.org/10.1002/1097-0118(200101)36:1<52::aid-jgt5>3.0.co;2-n

zbMATH Keywords

connectivityinduced cycleinduced path

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Related Items (15)

Nonseparating Cycles Avoiding Specific Vertices ⋮ Independent paths and \(K_{5}\)-subdivisions ⋮ Non-separating subgraphs after deleting many disjoint paths ⋮ Finding a shortest even hole in polynomial time ⋮ Removable paths and cycles with parity constraints ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ Partitions of graphs with high minimum degree or connectivity. ⋮ Non-separating even cycles in highly connected graphs ⋮ Rooted complete minors in line graphs with a Kempe coloring ⋮ Spanning trees with nonseparating paths ⋮ A weaker version of Lovász' path removal conjecture ⋮ What is on his mind? ⋮ Removable cycles in non-bipartite graphs ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Contractible subgraphs in 3-connected graphs

Cites Work

• Paths and edge-connectivity in graphs
• Non-separating induced cycles in graphs
• Contractible triples in 3-connected graphs
• Contractible subgraphs in 3-connected graphs
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Graph decomposition with applications to subdivisions and path systems modulo k
• Kuratowski's theorem
• Nonseparating cycles inK-Connected graphs

This page was built for publication: Induced paths in 5-connected graphs