On smallest 3-polytopes of given graph radius

DOI10.1016/j.disc.2023.113322OpenAlexW4317930305MaRDI QIDQ2689496

Riccardo W. Maffucci, Niels Willems

Publication date: 10 March 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.04743

zbMATH Keywords

prismplanar graphextremal problem3-polytopegraph radius

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Cites Work

• On the radius of graphs
• An upper bound for the radius of a 3-connected graph
• A simple proof of Menger's theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On smallest 3-polytopes of given graph radius