scientific article; zbMATH DE number 2192176
From MaRDI portal
Publication:5463552
Recommendations
- Contractible edges and longest cycles in 3-connected graphs
- A longest cycle and contractible edges
- scientific article; zbMATH DE number 4043878
- The 3‐connected graphs having a longest cycle containing only three contractible edges
- Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph
Cited in
(10)- Maximum number of contractible edges on Hamiltonian cycles of a 3-connected graph
- Contractible edges and longest cycles in 3-connected graphs
- On the number of contractible edges of longest cycles in k-connected graphs
- A longest cycle and contractible edges
- scientific article; zbMATH DE number 4043878 (Why is no real title available?)
- Longest cycles in 3-connected graphs contain three contractible edges
- The 3‐connected graphs having a longest cycle containing only three contractible edges
- Contractible edges in subgraphs of 2-connected graphs
- Lower bound on the maximum number of contractible edges on longest cycles of a 3-connected graph
- Contractible edges in longest cycles
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 Q5463552)
