Pages that link to "Item:Q3292139"
From MaRDI portal
The following pages link to Longest Simple Paths in Polyhedral Graphs (Q3292139):
Displaying 13 items.
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Longest cycles in polyhedral graphs (Q690053) (← links)
- Graphs of polyhedra; polyhedra as graphs (Q864132) (← links)
- Longest cycles in 3-connected cubic graphs (Q1074598) (← links)
- Regular separable graphs of minimum order with given diameter (Q1148920) (← links)
- Graphs of maximum diameter (Q1193709) (← links)
- On the Hamiltonian property hierarchy of 3-connected planar graphs (Q2094888) (← links)
- Treetopes and their graphs (Q2197683) (← links)
- Facets and nonfacets of convex polytopes (Q2528242) (← links)
- The \(d\)-step conjecture for polyhedra of dimension \(d<6\) (Q2529023) (← links)
- A simple 4-dimensional nonfacet (Q2532563) (← links)
- Polytopes, graphs, and complexes (Q5612292) (← links)
- APPLICATIONS OF LINKING INEQUALITIES TO AN ASYMMETRIC BEAM EQUATION (Q5863397) (← links)