Generation of 3-connected, planar line graphs
From MaRDI portal
Publication:6646421
DOI10.1016/j.disc.2024.114302MaRDI QIDQ6646421
Riccardo W. Maffucci, Phoebe Hollowbread-Smith
Publication date: 2 December 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The spanning connectivity of line graphs
- Connectivity augmentation in planar straight line graphs
- The construction and classification of self-dual spherical polyhedra
- Super connectivity of line graphs
- Parallel concepts in graph theory
- On \(3\)-connected plane graphs without triangular faces
- Essential edge connectivity of line graphs
- Polyhedra of small order and their Hamiltonian properties
- On polyhedral graphs and their complements
- Forbidden subgraphs for graphs with planar line graphs
- Generation of simple quadrangulations of the sphere
- Recursive generation of simple planar 5-regular graphs and pentangulations
- On generalized outerplanarity of line graphs
- Discrete complex analysis – the medial graph approach
- Self-dual polyhedra of given degree sequence
- Generation of Triangulations of the Sphere
- On Topological Invariants of the Product of Graphs
- Connectivity of iterated line graphs
- Connectivity of iterated line graphs
- Independence numbers of polyhedral graphs
- Characterising \(3\)-polytopes of radius one with unique realisation
This page was built for publication: Generation of 3-connected, planar line graphs
