Describing 4-paths in 3-polytopes with minimum degree 5

DOI10.1134/S0037446616050049MaRDI QIDQ511329zbMATH OpenFDO

Authors Oleg V. Borodin, Anna O. Ivanova

Publication date 15 February 2017

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

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

zbMATH Keywords

3-polytope4-pathplanar graphplane mapstructure properties

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Recommendations

• Tight description of 4-paths in 3-polytopes with minimum degree 5
• All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
• An extension of Franklin's theorem
• All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
• An analogue of Franklin's theorem

Cites work

• 5-stars of low weight in normal plane maps with minimum degree 5
• A structural property of convex 3-polytopes
• Describing 3-faces in normal plane maps with minimum degree 4
• Describing 3-paths in normal plane maps
• Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
• Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
• Describing faces in plane triangulations
• Describing tight descriptions of 3-paths in triangle-free normal plane maps
• scientific article; zbMATH DE number 4135967 (Why is no real title available?)
• Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
• Light subgraphs of graphs embedded in the plane. A survey
• Minimal vertex degree sum of a 3-path in plane maps
• Note on the weight of paths in plane triangulations of minimum degree 4 and 5
• On doubly light triangles in plane graphs
• On light subgraphs in plane graphs of minimum degree five
• Paths with restricted degrees of their vertices in planar graphs
• Quelques consequences simples de la formule d'Euler
• Short cycles of low weight in normal plane maps with minimum degree 5
• Structural Properties of Planar Maps with the Minimal Degree 5
• Structural theorem on plane graphs with application to the entire coloring number
• Two variations of Franklin's theorem

Cited in

(10)

• A tight description of 3-polytopes by their major 3-paths
• All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
• All tight descriptions of 3-paths in plane graphs with girth 8
• An extension of Franklin's theorem
• All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
• All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
• All tight descriptions of 3-paths in plane graphs with girth at least 7
• An analogue of Franklin's theorem
• Tight description of 4-paths in 3-polytopes with minimum degree 5
• Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27

This page was built for publication: Describing 4-paths in 3-polytopes with minimum degree 5

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