3 citations · 3 across the 7 of their papers we have counts for
7 papers
Generation of -connected, planar line graphs
Phoebe Hollowbread-Smith, Riccardo W. Maffucci
We classify and construct all line graphs that are -polytopes (planar and -connected). Apart from a few special cases, they are all obtained starting from the medial graphs o…
Classification and Construction of Planar, 3-Connected Kronecker Products
Riccardo W. Maffucci
We give a complete classification of the Kronecker (i.e. direct) product graphs that are planar and -connected (i.e. -polytopal). They are all of the form \[H\wedge K_2,\] wh…
Rao's Theorem for forcibly planar sequences revisited
Riccardo W. Maffucci
We consider the graph degree sequences such that every realisation is a polyhedron. It turns out that there are exactly eight of them. All of these are unigraphic, in the sense tha…
On unigraphic polyhedra with one vertex of degree
Jim Delitroz, Riccardo W. Maffucci
A sequence of non-negative integers is unigraphic if it is the degree sequence of exactly one graph, up to isomorphism. A polyhedral graph is a -connected, planar graph.…
On smallest -polytopes of given graph radius
Riccardo W. Maffucci, Niels Willems
The -polytopes are planar, -connected graphs. A classical question is, for , is the -gonal prism the unique -polytope of graph radi…
Characterising -polytopes of radius one with unique realisation
Riccardo W. Maffucci
Let be a planar, -connected graph of radius one on vertices, with vertices of degree three. We characterise all unigraphic degree sequences for such graphs, when $a\…