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

DOI10.1134/S0037446615040059zbMATH Open1410.52008OpenAlexW2250143022MaRDI QIDQ748469FDOQ748469

Oleg V. Borodin, Anna O. Ivanova

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

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

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)

Cites Work

• On acyclic colorings of planar graphs
• Structural theorem on plane graphs with application to the entire coloring number
• Light subgraphs of graphs embedded in the plane. A survey
• Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
• On light cycles in plane triangulations
• Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
• Structural Properties of Planar Maps with the Minimal Degree 5
• Title not available (Why is that?)
• Short cycles of low weight in normal plane maps with minimum degree 5
• On light subgraphs in plane graphs of minimum degree five
• Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
• Title not available (Why is that?)
• Title not available (Why is that?)
• The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5
• Quelques consequences simples de la formule d'Euler
• Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
• Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5
• Ensemble phase-averaged equations for bubbly flows

Cited In (4)

• Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5
• An analogue of Franklin's theorem
• On the weight of minor faces in triangle-free 3-polytopes
• All tight descriptions of 3-stars in 3-polytopes with girth 5

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)