On the structure of essentially-highly-connected polyhedral graphs
Authors:
- 22 July 2022
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 321, 308-315
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- An introduction to the discharging method via graph coloringDiscrete Mathematics, 2017
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-verticesDiscrete Mathematics, 2016
- The 7-cycle is light in the family of planar graphs with minimum degree 5Discrete Mathematics, 2007
- Planar Graphs Without Cycles of Specific LengthsEuropean Journal of Combinatorics, 2002
- Light paths in 4-connected graphs in the plane and other surfacesJournal of Graph Theory, 2000
- On light subgraphs in plane graphs of minimum degree fiveDiscussiones Mathematicae Graph Theory, 1996
- Simple paths on polyhedraPacific Journal of Mathematics, 1963
- A theorem on planar graphsTransactions of the American Mathematical Society, 1956