Can I read Independence Numbers of Polyhedral Graphs on EtoBox?

Independence Numbers of Polyhedral Graphs by Gaspoz, Sébastien; Maffucci, Riccardo W. is a scholarly article available to read on EtoBox.

What is Independence Numbers of Polyhedral Graphs about?

A polyhedral graph is a $3$-connected planar graph. We find the least possible order $p(k,a)$ of a polyhedral graph containing a $k$-independent set of size $a$ for all positive integers $k$ and $a$. In the case $k = 1$ and $a$ even, we prove that the extremal graphs are exactly the vertex-face (radial) graphs of maximal planar graphs.

Author

Gaspoz, Sébastien; Maffucci, Riccardo W.

Published

2022

Language

EN