Characterising 3-polytopes of radius one with unique realisation

MaRDI QIDQ6562434zbMATH OpenFDO

Authors Riccardo W. Maffucci

Publication date 26 June 2024

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

unigraphic degree sequences

Mathematics Subject Classification ID

Vertex degrees (05C07) Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Connectivity (05C40) Structural characterization of families of graphs (05C75) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Recommendations

• On unigraphic polyhedra with one vertex of degree \({p-2}\)
• On the faces of unigraphic 3-polytopes
• On smallest 3-polytopes of given graph radius
• Rao's theorem for forcibly planar sequences revisited
• scientific article; zbMATH DE number 4185644

Cites work

• A counterexample to the Hirsch conjecture
• A new bound of radius with irregularity index
• A note on diameter and the degree sequence of a graph
• A remark on the existence of finite graphs
• Congruent graphs and the connectivity of graphs
• Graphic sequences with unique realization
• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3014115 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• On polyhedral graphs and their complements
• On smallest 3-polytopes of given graph radius
• On unigraphic polyhedra with one vertex of degree \({p-2}\)
• Polyhedra of small order and their Hamiltonian properties
• Polyhedra with 4 to 8 faces
• Properties of unique realizations - a survey
• Rao's theorem for forcibly planar sequences revisited
• Self-dual polyhedra of given degree sequence
• Sequences with a unique realization by simple graphs
• Spectral radius and degree sequence of a graph
• The principal Erdős-Gallai differences of a degree sequence

Cited in

(5)

• On unigraphic polyhedra with one vertex of degree \({p-2}\)
• Rao's theorem for forcibly planar sequences revisited
• Generation of 3-connected, planar line graphs
• On the faces of unigraphic 3-polytopes
• On self-duality and unigraphicity for 3-polytopes

This page was built for publication: Characterising \(3\)-polytopes of radius one with unique realisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6562434)