Connectivity keeping edges in graphs with large minimum degree
From MaRDI portal
Recommendations
- Connectivity keeping paths in \(k\)-connected graphs
- Publication:5480725
- 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
- scientific article; zbMATH DE number 3885951 (Why is no real title available?)
- scientific article; zbMATH DE number 4160775 (Why is no real title available?)
- Contractible cycles in graphs with large minimum degree
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
- Contractible triples in 3-connected graphs
- Critically n-Connected Graphs
- Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
- Distribution of contractible edges in k-connected graphs
- Eine Eigenschaft der Atome endlicher Graphen
- Generalizaions of critical connectivity of graphs
- On \(k\)-con-critically \(n\)-connected graphs
- On critically h-connected simple graphs
- On k-critical, n-connected graphs
- On multiply critically h-connected graphs
Cited in
(21)- Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions
- Connectivity keeping trees in 2-connected graphs
- scientific article; zbMATH DE number 1409246 (Why is no real title available?)
- Extremal infinite graph theory
- Connectivity keeping trees in 2-connected graphs with girth conditions
- Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs
- Connectivity keeping paths in \(k\)-connected graphs
- Degree sequences and edge connectivity
- Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs
- Connectivity keeping caterpillars and spiders in 2-connected graphs
- Order of a Graph with given Vertex and Edge Connectivity and Minimum Degree
- Making the components of a graph \(k\)-connected
- Removing vertices from \(k\)-connected graphs without losing \(k\)-connectivity
- Connectivity keeping paths in \(k\)-connected bipartite graphs
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- Highly connected triples and Mader's conjecture
- Connectivity keeping stars or double-stars in 2-connected graphs
- Mader's conjecture for graphs with small connectivity
- Connectivity keeping trees in \(k\)-connected graphs
- High connectivity keeping sets in graphs and digraphs
- Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three
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)
