All tight descriptions of 3-stars in 3-polytopes with girth 5

DOI10.7151/dmgt.1905zbMath1354.05044OpenAlexW2469757163MaRDI QIDQ505457

Oleg V. Borodin, Anna O. Ivanova

Publication date: 23 January 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1905

zbMATH Keywords

planar graph3-polytopestructure properties\(k\)-star

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ Light 3-stars in sparse plane graphs ⋮ Soft 3-stars in sparse plane graphs ⋮ Minor stars in plane graphs with minimum degree five

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Describing 4-stars at 5-vertices in normal plane maps 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
• Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15
• The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5
• Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
• On light cycles in plane triangulations
• Light subgraphs of graphs embedded in the plane. A survey
• 5-stars of low weight in normal plane maps with minimum degree 5
• Structural Properties of Planar Maps with the Minimal Degree 5
• 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
• On the structure of plane graphs of minimum face size 5

This page was built for publication: All tight descriptions of 3-stars in 3-polytopes with girth 5