Connectivity keeping edges in graphs with large minimum degree
From MaRDI portal
Publication:933682
DOI10.1016/J.JCTB.2007.11.001zbMATH Open1155.05037OpenAlexW2072217169MaRDI QIDQ933682FDOQ933682
Authors: Shinya Fujita, Ken-ichi Kawarabayashi 
Publication date: 24 July 2008
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.2007.11.001
Recommendations
- Connectivity keeping paths in \(k\)-connected graphs
- scientific article; zbMATH DE number 5043408
- Connectivity keeping trees in \(k\)-connected graphs
- A generalization of an edge-connectivity theorem of Chartrand
- Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \)
Cites Work
- Generalizaions of critical connectivity of graphs
- On critically h-connected simple 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]\)
- On \(k\)-con-critically \(n\)-connected graphs
- Title not available (Why is that?)
- Contractible triples in 3-connected graphs
- Distribution of contractible edges in k-connected graphs
- On k-critical, n-connected graphs
- Eine Eigenschaft der Atome endlicher Graphen
- Critically n-Connected Graphs
- On multiply critically h-connected graphs
- Contractible cycles in graphs with large minimum degree
- Title not available (Why is that?)
Cited In (21)
- Connectivity keeping trees in 2-connected graphs
- Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs
- Connectivity keeping stars or double-stars in 2-connected graphs
- Connectivity keeping paths in \(k\)-connected graphs
- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
- Making the components of a graph \(k\)-connected
- Connectivity keeping caterpillars and spiders in 2-connected graphs
- Connectivity keeping trees in \(k\)-connected graphs
- Removing vertices from \(k\)-connected graphs without losing \(k\)-connectivity
- Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs
- Highly connected triples and Mader's conjecture
- Extremal infinite graph theory
- High connectivity keeping sets in graphs and digraphs
- Mader's conjecture for graphs with small connectivity
- Title not available (Why is that?)
- Connectivity keeping paths in \(k\)-connected bipartite graphs
- Connectivity keeping trees in 2-connected graphs with girth conditions
- Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three
- Degree sequences and edge connectivity
This page was built for publication: Connectivity keeping edges in graphs with large minimum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q933682)
