Non-separating subgraphs in highly connected graphs

DOI10.1016/j.jctb.2015.12.001zbMath1330.05089OpenAlexW2198977702MaRDI QIDQ905893

Shinya Fujita, Ken-ichi Kawarabayashi

Publication date: 28 January 2016

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2015.12.001

zbMATH Keywords

decompositioncyclestriangleshighly connected subgraphcontractible edgesnon-separating induced cycle

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partition of graphs with condition on the connectivity and minimum degree
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• Generalizaions of critical connectivity of graphs
• 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
• Contractible edges and triangles in \(k\)-connected graphs
• A connected subgraph maintaining high connectivity
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Graph decomposition with constraints on the connectivity and minimum degree
• Nonseparating cycles inK-Connected graphs
• How to Draw a Graph

This page was built for publication: Non-separating subgraphs in highly connected graphs