On light cycles in plane triangulations

Stanislav Jendrol', Tomáš Madaras, Roman Soták, Z. Tuza

Research output: Contribution to journalArticle

30 Citations (Scopus)

Abstract

A subgraph of a plane graph is light if each of its vertices has a small degree in the entire graph. Consider the class script T sign(5) of plane triangulations of minimum degree 5. It is known that each G ∈ script T sign(5) contains a light triangle. From a recent result of Jendrol' and Madaras the existence of light cycles C4 and C5 in each G ∈ script T sign(5) follows. We prove here that each G ∈ script T sign(5) contains also light cycles C6,C7,C8 and C9 such that every vertex is of degree at most 11, 17,29 and 41, respectively. Moreover, we prove that no cycle Ck with k≥11 is light in the class script T sign(5).

Original languageEnglish
Pages (from-to)453-467
Number of pages15
JournalDiscrete Mathematics
Volume197-198
Publication statusPublished - Feb 28 1999

Fingerprint

Triangulation
Cycle
Plane Graph
Minimum Degree
Subgraph
Triangle
Entire
Graph in graph theory
Vertex of a graph
Class

Keywords

  • Cycles
  • Light subgraph
  • Planar graph
  • Triangulation

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Jendrol', S., Madaras, T., Soták, R., & Tuza, Z. (1999). On light cycles in plane triangulations. Discrete Mathematics, 197-198, 453-467.

On light cycles in plane triangulations. / Jendrol', Stanislav; Madaras, Tomáš; Soták, Roman; Tuza, Z.

In: Discrete Mathematics, Vol. 197-198, 28.02.1999, p. 453-467.

Research output: Contribution to journalArticle

Jendrol', S, Madaras, T, Soták, R & Tuza, Z 1999, 'On light cycles in plane triangulations', Discrete Mathematics, vol. 197-198, pp. 453-467.
Jendrol' S, Madaras T, Soták R, Tuza Z. On light cycles in plane triangulations. Discrete Mathematics. 1999 Feb 28;197-198:453-467.
Jendrol', Stanislav ; Madaras, Tomáš ; Soták, Roman ; Tuza, Z. / On light cycles in plane triangulations. In: Discrete Mathematics. 1999 ; Vol. 197-198. pp. 453-467.
@article{7b811db0fe8a4fc79f9a5f1e280aecc5,
title = "On light cycles in plane triangulations",
abstract = "A subgraph of a plane graph is light if each of its vertices has a small degree in the entire graph. Consider the class script T sign(5) of plane triangulations of minimum degree 5. It is known that each G ∈ script T sign(5) contains a light triangle. From a recent result of Jendrol' and Madaras the existence of light cycles C4 and C5 in each G ∈ script T sign(5) follows. We prove here that each G ∈ script T sign(5) contains also light cycles C6,C7,C8 and C9 such that every vertex is of degree at most 11, 17,29 and 41, respectively. Moreover, we prove that no cycle Ck with k≥11 is light in the class script T sign(5).",
keywords = "Cycles, Light subgraph, Planar graph, Triangulation",
author = "Stanislav Jendrol' and Tom{\'a}š Madaras and Roman Sot{\'a}k and Z. Tuza",
year = "1999",
month = "2",
day = "28",
language = "English",
volume = "197-198",
pages = "453--467",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",

}

TY - JOUR

T1 - On light cycles in plane triangulations

AU - Jendrol', Stanislav

AU - Madaras, Tomáš

AU - Soták, Roman

AU - Tuza, Z.

PY - 1999/2/28

Y1 - 1999/2/28

N2 - A subgraph of a plane graph is light if each of its vertices has a small degree in the entire graph. Consider the class script T sign(5) of plane triangulations of minimum degree 5. It is known that each G ∈ script T sign(5) contains a light triangle. From a recent result of Jendrol' and Madaras the existence of light cycles C4 and C5 in each G ∈ script T sign(5) follows. We prove here that each G ∈ script T sign(5) contains also light cycles C6,C7,C8 and C9 such that every vertex is of degree at most 11, 17,29 and 41, respectively. Moreover, we prove that no cycle Ck with k≥11 is light in the class script T sign(5).

AB - A subgraph of a plane graph is light if each of its vertices has a small degree in the entire graph. Consider the class script T sign(5) of plane triangulations of minimum degree 5. It is known that each G ∈ script T sign(5) contains a light triangle. From a recent result of Jendrol' and Madaras the existence of light cycles C4 and C5 in each G ∈ script T sign(5) follows. We prove here that each G ∈ script T sign(5) contains also light cycles C6,C7,C8 and C9 such that every vertex is of degree at most 11, 17,29 and 41, respectively. Moreover, we prove that no cycle Ck with k≥11 is light in the class script T sign(5).

KW - Cycles

KW - Light subgraph

KW - Planar graph

KW - Triangulation

UR - http://www.scopus.com/inward/record.url?scp=0039111034&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0039111034&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0039111034

VL - 197-198

SP - 453

EP - 467

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

ER -