Characterising \(3\)-polytopes of radius one with unique realisation
From MaRDI portal
Publication:6562434
zbMATH Open1542.05044MaRDI QIDQ6562434
Publication date: 26 June 2024
Published in: The Australasian Journal of Combinatorics (Search for Journal in Brave)
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) Structural characterization of families of graphs (05C75) Connectivity (05C40) Vertex degrees (05C07)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new bound of radius with irregularity index
- A counterexample to the Hirsch conjecture
- Congruent graphs and the connectivity of graphs
- A note on diameter and the degree sequence of a graph
- Properties of unique realizations - a survey
- Polyhedra with 4 to 8 faces
- Sequences with a unique realization by simple graphs
- Graphic sequences with unique realization
- Polyhedra of small order and their Hamiltonian properties
- Spectral radius and degree sequence of a graph
- The principal Erdős-Gallai differences of a degree sequence
- On polyhedral graphs and their complements
- On smallest 3-polytopes of given graph radius
- A remark on the existence of finite graphs
- Self-dual polyhedra of given degree sequence
- On unigraphic polyhedra with one vertex of degree \({p-2}\)
- Rao's theorem for forcibly planar sequences revisited
Related Items (3)
Rao's theorem for forcibly planar sequences revisited ⋮ Generation of 3-connected, planar line graphs ⋮ On the faces of unigraphic 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)
