scientific article

zbMath0757.05073MaRDI QIDQ4018722

Roman Kekeňák, Stanlislav Jendroľ

Publication date: 16 January 1993

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

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

zbMATH Keywords

connectivityHamiltonicity3-polytopeslongest circuits

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters ⋮ 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On quadrangular convex 3-polytopes with at most two types of edges
• On shortness exponents of families of graphs
• On the simplicial 3-polytopes with only two types of edges
• Shortness coefficient of cyclically 5-connected cubic planar graphs
• 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 parameters of families of regular planar graphs in two or three types of faces
• Pairs of edge-disjoint Hamiltonian circuits
• Hamiltonian circuits in simplicial complexes
• Shortness exponents of families of graphs
• Regular planar graphs with faces of only two types and shortness parameters
• Some new results about the shortness exponent in polyhedral graphs
• Polytopes, graphs, and complexes

This page was built for publication: