Light 3-paths in 3-polytopes without adjacent triangles

DOI10.1134/S0037446624020022MaRDI QIDQ6203328FDOQ6203328

Authors: Oleg V. Borodin, Anna O. Ivanova 

Publication date: 27 March 2024

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

Recommendations

• Light 3-faces in 3-polytopes without adjacent triangles
• Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
• Triangulated \(3\)-polytopes without faces of low weight
• Weight of 3-paths in sparse plane graphs
• Joint extension of two theorems of Kotzig on 3-polytopes

zbMATH Keywords

weightplane graph3-path3-polytopestructural propertysparse polytope

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Paths and cycles (05C38)

Cites Work

• A structural property of convex 3-polytopes
• Light subgraphs of graphs embedded in the plane. A survey
• Describing 3-paths in normal plane maps
• Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
• Note on the weight of paths in plane triangulations of minimum degree 4 and 5
• An analogue of Franklin's theorem
• Minimal vertex degree sum of a 3-path in plane maps
• On light subgraphs in plane graphs of minimum degree five
• Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
• Paths with restricted degrees of their vertices in planar graphs
• Two variations of Franklin's theorem
• An introduction to the discharging method via graph coloring
• Planar graphs without cycles of specific lengths
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• Title not available (Why is that?)
• An extension of Franklin's theorem
• More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges

Cited In (1)

• Light 3-faces in 3-polytopes without adjacent triangles

This page was built for publication: Light 3-paths in 3-polytopes without adjacent triangles

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