scientific article; zbMATH DE number 4043878
From MaRDI portal
Publication:3781783
Recommendations
Cited in
(32)- The number of contractible edges in 3-connected graphs
- Contractible edges in longest cycles in non-Hamiltonian graphs
- A longest cycle version of Tutte's wheels theorem
- On contractible and vertically contractible elements in 3-connected matroids and graphs
- Contractible non-edges in \(3\)-connected graphs
- On non-essential edges in 3-connected graphs
- Contractible subgraphs in 3-connected graphs
- Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph
- An included-minor result for 3-connected graphs with contractible edges
- Contractible edges in \(k\)-connected graphs with minimum degree greater than or equal to \(\lfloor \frac{ 3 k - 1}{ 2} \rfloor \)
- Contractible non-edges in 3-connected infinite graphs
- On small contractible subgraphs in 3-connected graphs of small average degree
- On the number of contractible triples in 3-connected graphs
- Contractible edges and longest cycles in 3-connected graphs
- Properly 3-contractible edges in a minimally 3-connected graph
- scientific article; zbMATH DE number 4202289 (Why is no real title available?)
- A longest cycle and contractible edges
- Longest cycles in 3-connected graphs contain three contractible edges
- Covering contractible edges in 3‐connected graphs. I: Covers of size three are cutsets
- scientific article; zbMATH DE number 38315 (Why is no real title available?)
- scientific article; zbMATH DE number 166075 (Why is no real title available?)
- The 3‐connected graphs having a longest cycle containing only three contractible edges
- scientific article; zbMATH DE number 637540 (Why is no real title available?)
- scientific article; zbMATH DE number 1933263 (Why is no real title available?)
- scientific article; zbMATH DE number 2108141 (Why is no real title available?)
- scientific article; zbMATH DE number 874204 (Why is no real title available?)
- scientific article; zbMATH DE number 874284 (Why is no real title available?)
- Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
- Contractible Edges in 3-Connected Cubic Graphs
- scientific article; zbMATH DE number 2192176 (Why is no real title available?)
- Contractible triples in highly connected graphs
- On the structure of contractible edges in \(k\)-connected partial \(k\)-trees
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3781783)
