Independence numbers of polyhedral graphs

DOI10.1016/j.amc.2023.128349arXiv2212.14323MaRDI QIDQ6068196

Riccardo W. Maffucci, Sébastien Gaspoz

Publication date: 13 November 2023

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

independent setplanar graphextremal problem3-polytoperadial graph

Mathematics Subject Classification ID

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) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

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

Cites Work

• Graphs of polyhedra; polyhedra as graphs
• The construction and classification of self-dual spherical polyhedra
• The \(k\)-independence number of \(t\)-connected graphs
• Generation of simple quadrangulations of the sphere
• Reducibility among Combinatorial Problems
• Self-dual polyhedra of given degree sequence
• Diameters of Polyhedral Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Independence numbers of polyhedral graphs