All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
type: Item
instance of: scholarly article
title: All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\)
zbMATH Open document ID: 1397.05040
author: Oleg V. Borodin
author: Anna O. Ivanova
published in: Discrete Mathematics
publication date: 2018-10-23T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6963402
zbMATH Keywords: plane graph
zbMATH Keywords: 3-polytope
zbMATH Keywords: normal plane map
zbMATH Keywords: structural property
zbMATH Keywords: 3-path
MaRDI profile type: Publication
full work available at URL: j.disc.2018.08.026
OpenAlex ID: W2890761766
cites work: Weight of 3-paths in sparse plane graphs
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: An analogue of Franklin's theorem
cites work: Describing 3-paths in normal plane maps
cites work: Tight Descriptions of 3‐Paths in Normal Plane Maps
cites work: A structural property of convex 3-polytopes
cites work: Paths with restricted degrees of their vertices in planar graphs
cites work: Describing short paths in plane graphs of girth at least 5
cites work: 3-paths in graphs with bounded average degree
cites work: Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
cites work: Note on 3-paths in plane graphs of girth 4
DOI: 10.1016/J.DISC.2018.08.026
description: scientific article; zbMATH DE number 6963402