Light 3-paths in 3-polytopes without adjacent triangles
From MaRDI portal
Publication:6203328
DOI10.1134/s0037446624020022MaRDI QIDQ6203328
Oleg V. Borodin, Anna O. Ivanova
Publication date: 27 March 2024
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- Unnamed Item
- An analogue of Franklin's theorem
- Describing 3-paths in normal plane maps
- An introduction to the discharging method via graph coloring
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Planar graphs without cycles of specific lengths
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- A structural property of convex 3-polytopes
- Light subgraphs of graphs embedded in the plane. A survey
- An extension of Franklin's theorem
- Note on the weight of paths in plane triangulations of minimum degree 4 and 5
- 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
- More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges
- Paths with restricted degrees of their vertices in planar graphs
This page was built for publication: Light 3-paths in 3-polytopes without adjacent triangles
