44 citations · 77 across the 17 of their papers we have counts for
1 paper · 1 filter
Bruno Benedetti, Marta Pavelka
For d≥2, we show that all graphs of d-polytopes have a Hamiltonian line graph if and only if d=3: We exhibit a graph of a 3-polytope on 252 vertices whose line gr…