Pages that link to "Item:Q1732035"
From MaRDI portal
The following pages link to Polyhedra with few 3-cuts are Hamiltonian (Q1732035):
Displaying 12 items.
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- Non-Hamiltonian 1-tough triangulations with disjoint separating triangles (Q777448) (← links)
- Hamiltonian cycles in 4-connected plane triangulations with few 4-separators (Q2005718) (← links)
- 4-connected polyhedra have at least a linear number of Hamiltonian cycles (Q2048366) (← links)
- A counterexample to prism-Hamiltonicity of 3-connected planar graphs (Q2221929) (← links)
- Shortness coefficient of cyclically 4-edge-connected cubic graphs (Q2294112) (← links)
- Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian (Q2662552) (← links)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
- $K_2$-Hamiltonian Graphs: I (Q5009329) (← links)
- Types of triangle in Hamiltonian triangulations and an application to domination and k-walks (Q5217058) (← links)
- On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs (Q6093144) (← links)
- Counting cycles in planar triangulations (Q6652098) (← links)
