Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15

DOI10.1134/S0037446615040059zbMATH Open1410.52008OpenAlexW2250143022MaRDI QIDQ748469FDOQ748469

Authors Anna O. Ivanova, Oleg V. Borodin 

Publication date 29 October 2015

Published in Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0037446615040059

zbMATH Keywords

heightplane graph3-polytopestructural properties

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Three-dimensional polytopes (52B10) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Recommendations

• 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
• Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5
• Cyclic degrees of 3-polytopes
• Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9

Cites work

• scientific article; zbMATH DE number 3504992 (Why is no real title available?)
• scientific article; zbMATH DE number 1536529 (Why is no real title available?)
• scientific article; zbMATH DE number 3390789 (Why is no real title available?)
• Ensemble phase-averaged equations for bubbly flows
• 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
• 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
• Light subgraphs of graphs embedded in the plane. A survey
• On acyclic colorings of planar graphs
• On light cycles in plane triangulations
• On light subgraphs in plane graphs of minimum degree five
• Quelques consequences simples de la formule d'Euler
• Short cycles of low weight in normal plane maps with minimum degree 5
• Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
• Structural Properties of Planar Maps with the Minimal Degree 5
• Structural theorem on plane graphs with application to the entire coloring number
• The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5

Cited in

(5)

• Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5
• Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
• All tight descriptions of 3-stars in 3-polytopes with girth 5
• An analogue of Franklin's theorem
• On the weight of minor faces in triangle-free 3-polytopes

This page was built for publication: Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q748469)