Removable edges in a 5-connected graph and a construction method of 5-connected graphs
Let \(e\) be an edge of a k-connected graph. Let \(H\) be the graph obtained from \(G\) by removing \(e\) from \(G\), and for any end vertex \(x\) of \(e\) with degree \(k-1\) in \(G-e\), delete \(x\) and then add edges between any pair of non-adjacent vertices in the neighbour set of \(x\) in \(G-e\). If \(H\) is k-connected then e is said to be a removable edge of \(G\). The authors prove that a 5-connected graph has no removable edge if and only if it is isomorphic to \(K_6\). For a k-connected graph \(G\) such that end vertices of any edge of \(G\) have at most \(k-3\) common adjacent vertices, the authors prove that \(G\) has a removable edge.
- Removable edges in a 5-connected graph
- Removable edges of cycles in 5-connected graphs
- The removable edges and the contractible subgraphs of 5-connected graphs
- Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
- Removable edges in cycles of a k-connected graph
- A classification of 4-connected graphs
- A Construction Method For Minimally K-Edge-Connected Graphs
- A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
- A Reduction Method for Edge-Connectivity in Graphs
- Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
- Contractible edges in triangle-free graphs
- Generalizaions of critical connectivity of graphs
- Graph theory
- scientific article; zbMATH DE number 3882430 (Why is no real title available?)
- scientific article; zbMATH DE number 3885951 (Why is no real title available?)
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 568849 (Why is no real title available?)
- scientific article; zbMATH DE number 1500199 (Why is no real title available?)
- scientific article; zbMATH DE number 1530019 (Why is no real title available?)
- scientific article; zbMATH DE number 1827741 (Why is no real title available?)
- Minimally 2-connected graphs.
- Minimally 3-connected graphs
- Minors of quasi 4-connected graphs
- Note on k-contractible edges in k-connected graphs
- On a property of n-edge-connected digraphs
- On k-critical, n-connected graphs
- On k-minimally n-edge-connected graphs
- On locally \(k\)-critically \(n\)-connected graphs
- Reducible chains in several types of 2-connected graphs
- Removable edges in 3-connected graphs
- Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge
- The number of removable edges in 3-connected graphs
- The structure of quasi 4-connected graphs
- Uncontractable 4-connected graphs
- Removable edges in a \(k\)-connected graph and a construction method for \(k\)-connected graphs
- Removable edges in a spanning tree of a k-connected graph
- Removable edges in a 5-connected graph
- The removable edges and the contractible subgraphs of 5-connected graphs
- Removable edges in cycles of a k-connected graph
- Uniformly 3‐connected graphs
- A survey on the vertex-(edge-)k-maximal graphs and the k-vertex-(edge-)connected graphs with redundant subgraphs
- A result on quasi \(k\)-connected graphs
- Removable edges of cycles in 5-connected graphs
This page was built for publication: Removable edges in a 5-connected graph and a construction method of 5-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477398)
