On light cycles in plane triangulations

DOI10.1016/S0012-365X(99)90099-7zbMath0936.05065OpenAlexW4210570893MaRDI QIDQ1292852

Zsolt Tuza, Tomáš Madaras, Roman Soták, Stanlislav Jendroľ

Publication date: 13 February 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90099-7

zbMATH Keywords

light subgraphsplane triangulationslight cycles

Mathematics Subject Classification ID

Three-dimensional polytopes (52B10) Paths and cycles (05C38)

Related Items (21)

Heavy paths, light stars, and big melons ⋮ An analogue of Franklin's theorem ⋮ On the Decay of Crossing Numbers of Sparse Graphs ⋮ Four gravity results ⋮ The structure of 1-planar graphs ⋮ Light graphs in families of outerplanar graphs ⋮ Lightness, heaviness and gravity ⋮ The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5 ⋮ On doubly light triangles in plane graphs ⋮ Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 ⋮ Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 ⋮ Weights of induced subgraphs in \(K_{1,r}\)-free graphs ⋮ All tight descriptions of 3-stars in 3-polytopes with girth 5 ⋮ Light paths in 4-connected graphs in the plane and other surfaces ⋮ On large light graphs in families of polyhedral graphs ⋮ Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds ⋮ Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight ⋮ Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9 ⋮ Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 ⋮ On \(3\)-connected plane graphs without triangular faces ⋮ Nearly light cycles in embedded graphs and crossing-critical graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangles with restricted degree sum of their boundary vertices in plane graphs
• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• On vertex-degree restricted paths in polyhedral graphs
• On the total coloring of planar graphs.
• Minimal vertex degree sum of a 3-path in plane maps
• Short cycles of low weight in normal plane maps with minimum degree 5
• On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
• On light subgraphs in plane graphs of minimum degree five
• Paths with restricted degrees of their vertices in planar graphs

This page was built for publication: On light cycles in plane triangulations