Non-separating subgraphs in highly connected graphs

DOI10.1016/J.JCTB.2015.12.001zbMATH Open1330.05089OpenAlexW2198977702MaRDI QIDQ905893FDOQ905893

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

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

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)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• 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)