Some new results about the shortness exponent in polyhedral graphs

DOI10.21136/cpm.1987.118302zbMath0642.05039OpenAlexW2730075646MaRDI QIDQ3783323

Hansjoachim Walther, Jochen Harant

Publication date: 1987

Full work available at URL: https://eudml.org/doc/21668

zbMATH Keywords

regular graphsHamiltonian circuit3-polytopesshortness exponentmaximal length of a circuit

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Polytopes and polyhedra (52Bxx)

Related Items (5)

Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters ⋮ Unnamed Item ⋮ Shortness coefficient of cyclically 4-edge-connected cubic graphs ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication: Some new results about the shortness exponent in polyhedral graphs