All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
From MaRDI portal
Publication:2033345
DOI10.33048/semi.2021.18.031zbMath1462.05309OpenAlexW3201527547MaRDI QIDQ2033345
Dmitrii Vladislavovich Nikiforov, Anna O. Ivanova, Tsyndyma Chemit-Dorzhievna Batueva, Oleg V. Borodin
Publication date: 17 June 2021
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.33048/semi.2021.18.031
Cites Work
- Unnamed Item
- Unnamed Item
- An analogue of Franklin's theorem
- Describing 3-paths in normal plane maps
- Describing short paths in plane graphs of girth at least 5
- Weight of 3-paths in sparse plane graphs
- Light subgraphs of graphs embedded in the plane. A survey
- An extension of Franklin's theorem
- All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- Note on the weight of paths in plane triangulations of minimum degree 4 and 5
- Structural Properties of Planar Maps with the Minimal Degree 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
- Paths with restricted degrees of their vertices in planar graphs
- Tight Descriptions of 3‐Paths in Normal Plane Maps
This page was built for publication: All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
