Pages that link to "Item:Q1907113"
From MaRDI portal
The following pages link to Polyhedra of small order and their Hamiltonian properties (Q1907113):
Displaying 14 items.
- Combinatorial optimization in geometry (Q1408292) (← links)
- Generating rooted triangulations without repetitions (Q1817003) (← links)
- Vertex degrees and 2-cuts in graphs with many Hamiltonian vertex-deleted subgraphs (Q2059878) (← links)
- On polyhedral graphs and their complements (Q2172835) (← links)
- Longer cycles in essentially 4-connected planar graphs (Q2282479) (← links)
- Generation of simple quadrangulations of the sphere (Q2581402) (← links)
- Construction of planar triangulations with minimum degree 5 (Q2581624) (← links)
- (Q2741325) (← links)
- On the toughness index of planar graphs (Q4277991) (← links)
- Self-polar polytopes (Q4998744) (← links)
- Self-dual polyhedra of given degree sequence (Q5058165) (← links)
- Hamiltonicity of Cubic Planar Graphs with Bounded Face Sizes (Q5075839) (← links)
- A Computer-Assisted Proof of the Barnette--Goodey Conjecture: Not Only Fullerene Graphs Are Hamiltonian (Q5208741) (← links)
- On the Circumference of Essentially 4-connected Planar Graphs (Q5208868) (← links)
