scientific article; zbMATH DE number 908142

zbMath0852.05057MaRDI QIDQ4886927

Michal Tkáč

Publication date: 23 July 1996

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

planar graphsHamiltonian graphshortness coefficientlongest circuits3-polytopial graphs

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex 3-polytopes with exactly two types of edges
• Simple 3-polytopal graphs with edges of only two types and shortness coefficients
• Longest cycles in 3-connected cubic graphs
• On a class of Hamiltonian polytopes
• Shortness exponents of families of graphs
• Some new results about the shortness exponent in polyhedral graphs