All tight descriptions of 3-paths in plane graphs with girth at least 9
type: Item
instance of: scholarly article
title: All tight descriptions of 3-paths in plane graphs with girth at least 9
zbMATH Open document ID: 1398.05067
publication date: 2018-10-31T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6969408
zbMATH Keywords: plane graph
zbMATH Keywords: structure properties
zbMATH Keywords: tight description
zbMATH Keywords: 3-path
zbMATH Keywords: minimum degree
zbMATH Keywords: girth
author: Valerii A. Aksenov
author: Oleg V. Borodin
author: Anna O. Ivanova
MaRDI profile type: Publication
cites work: Weight of 3-paths in sparse plane graphs
cites work: On the total coloring of planar graphs.
cites work: Joint extension of two theorems of Kotzig on 3-polytopes
cites work: Q4013453
cites work: Minimal vertex degree sum of a 3-path in plane maps
cites work: Describing tight descriptions of 3-paths in triangle-free normal plane maps
cites work: All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
cites work: Describing 3-paths in normal plane maps
cites work: Tight Descriptions of 3‐Paths in Normal Plane Maps
cites work: Q4117038
cites work: Paths with restricted degrees of their vertices in planar graphs
cites work: A structural property of convex 3-polytopes
cites work: Describing short paths in plane graphs of girth at least 5
cites work: Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
cites work: 3-paths in graphs with bounded average degree
cites work: Note on 3-paths in plane graphs of girth 4
cites work: Light subgraphs of graphs embedded in the plane. A survey
cites work: Quelques consequences simples de la formule d'Euler
DOI: 10.17377/SEMI.2018.15.095
published in: Sibirskie Elektronnye Matematicheskie Izvestiya
description: scientific article; zbMATH DE number 6969408