Minimal vertex degree sum of a 3-path in plane maps

DOI10.7151/dmgt.1055zbMath0906.05017OpenAlexW2318826893MaRDI QIDQ4210671

Oleg V. Borodin

Publication date: 27 September 1998

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ad146dfecb451b41a34dad6ebb1cebe2135f851c

zbMATH Keywords

pathplane mapminimum degree sum

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (26)

All tight descriptions of 3-paths in plane graphs with girth at least 9 ⋮ All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ Heavy paths, light stars, and big melons ⋮ An analogue of Franklin's theorem ⋮ Low 5-stars in normal plane maps with minimum degree 5 ⋮ Light 3-stars in sparse plane graphs ⋮ Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11 ⋮ Lightness, heaviness and gravity ⋮ All tight descriptions of 3-paths in plane graphs with girth at least 7 ⋮ All tight descriptions of 3-paths in plane graphs with girth 8 ⋮ Describing 3-paths in normal plane maps ⋮ Weight of 3-paths in sparse plane graphs ⋮ Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices ⋮ Light 3-paths in 3-polytopes without adjacent triangles ⋮ An extension of Franklin's theorem ⋮ Soft 3-stars in sparse plane graphs ⋮ Describing 4-paths in 3-polytopes with minimum degree 5 ⋮ A tight description of 3-polytopes by their major 3-paths ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ All tight descriptions of major 3-paths in 3-polytopes without 3-vertices ⋮ All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\) ⋮ Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9 ⋮ On \(3\)-connected plane graphs without triangular faces ⋮ On light cycles in plane triangulations ⋮ Describing tight descriptions of 3-paths in triangle-free normal plane maps ⋮ Tight Descriptions of 3‐Paths in Normal Plane Maps

This page was built for publication: Minimal vertex degree sum of a 3-path in plane maps