On unigraphic polyhedra with one vertex of degree \({p-2}\)

DOI10.1007/s00025-023-02099-8arXiv2301.08021MaRDI QIDQ6185799

Riccardo W. Maffucci, Jim Delitroz

Publication date: 30 January 2024

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

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

zbMATH Keywords

enumerationplanar graphdegree sequence3-polytopevalencyunigraphicunique realisation

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Vertex degrees (05C07) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Properties of unique realizations - a survey
• Sequences with a unique realization by simple graphs
• Graphic sequences with unique realization
• A polyhedral approach to least cost influence maximization in social networks
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
• Independence numbers of polyhedral graphs

This page was built for publication: On unigraphic polyhedra with one vertex of degree \({p-2}\)