Non-separating subgraphs in highly connected graphs

DOI10.1016/J.JCTB.2015.12.001MaRDI QIDQ905893zbMATH OpenOpenAlexFDO

Authors 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) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Non-separating even cycles in highly connected graphs
• Note on non-separating and removable cycles in highly connected graphs
• scientific article; zbMATH DE number 568792
• Nonseparating cycles avoiding specific vertices
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph

Cites work

• scientific article; zbMATH DE number 4164908 (Why is no real title available?)
• scientific article; zbMATH DE number 4077268 (Why is no real title available?)
• scientific article; zbMATH DE number 944226 (Why is no real title available?)
• A connected subgraph maintaining high connectivity
• Contractible edges and triangles in k-connected graphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
• Generalizaions of critical connectivity of graphs
• Graph decomposition with constraints on the connectivity and minimum degree
• How to Draw a Graph
• Nonseparating cycles inK-Connected graphs
• Note on \(k\)-contractible edges in \(k\)-connected graphs
• Partition of graphs with condition on the connectivity and minimum degree
• Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge

Cited in

(6)

• A connected subgraph maintaining high connectivity
• On a conjecture of Thomassen
• scientific article; zbMATH DE number 2191994 (Why is no real title available?)
• Non-separating even cycles in highly connected graphs
• Note on non-separating and removable cycles in highly connected graphs
• Connecting Terminals and 2-Disjoint Connected Subgraphs

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

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