REAL

The Minimum Number of 4-Cycles in a Maximal Planar Graph with Small Number of Vertices

Győri, Ervin and Addisu, Paulos and Zamora, Oscar (2023) The Minimum Number of 4-Cycles in a Maximal Planar Graph with Small Number of Vertices. Bulletin of the Iranian Mathematical Society, 49 (5). ISSN 1018-6301

[img]
Preview
Text
2005.12100v2.pdf

Download (120kB) | Preview

Abstract

Hakimi and Schmeichel determined a sharp lower bound for the number of cycles of length 4 in a maximal planar graph with n vertices, n≥ 5 . It has been shown that the bound is sharp for n= 5 , 12 and n≥ 14 vertices. However, the authors only conjectured the minimum number of cycles of length 4 for maximal planar graphs with the remaining small vertex numbers. In this note, we confirm their conjecture. © 2023, The Author(s) under exclusive licence to Iranian Mathematical Society.

Item Type: Article
Additional Information: Export Date: 20 February 2024 Correspondence Address: Paulos, A.; Central European UniversityHungary; email: addisu_2004@yahoo.com
Uncontrolled Keywords: Planar graphs; 4-cycle; Maximal planar graphs;
Subjects: Q Science / természettudomány > QA Mathematics / matematika
SWORD Depositor: MTMT SWORD
Depositing User: MTMT SWORD
Date Deposited: 05 Apr 2024 10:10
Last Modified: 05 Apr 2024 10:10
URI: https://real.mtak.hu/id/eprint/191850

Actions (login required)

Edit Item Edit Item