All tight descriptions of 4-paths in 3-polytopes with minimum degree 5

DOI10.1007/S00373-016-1755-2MaRDI QIDQ2361076zbMATH OpenOpenAlexFDO

Authors Ts. Ch.-D. Batueva, Oleg V. Borodin, Anna O. Ivanova

Publication date 29 June 2017

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-016-1755-2

zbMATH Keywords

3-polytopeplanar graphplane mapstructure propertiesweight

Mathematics Subject Classification ID

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

Recommendations

• Tight description of 4-paths in 3-polytopes with minimum degree 5
• Describing 4-paths in 3-polytopes with minimum degree 5
• All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
• A tight description of 3-polytopes by their major 3-paths
• An analogue of Franklin's theorem

Cites work

• 5-stars of low weight in normal plane maps with minimum degree 5
• A structural property of convex 3-polytopes
• All tight descriptions of 3-stars in 3-polytopes with girth 5
• An analogue of Franklin's theorem
• Describing 3-paths in normal plane maps
• Describing 4-paths in 3-polytopes with minimum degree 5
• Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
• Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
• Describing short paths in plane graphs of girth at least 5
• Describing tight descriptions of 3-paths in triangle-free normal plane maps
• Light and low 5-stars in normal plane maps with minimum degree 5
• Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
• Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
• Light subgraphs of graphs embedded in the plane. A survey
• Minimal vertex degree sum of a 3-path in plane maps
• Note on 3-paths in plane graphs of girth 4
• Note on the weight of paths in plane triangulations of minimum degree 4 and 5
• On light subgraphs in plane graphs of minimum degree five
• On the total coloring of planar graphs.
• Paths with restricted degrees of their vertices in planar graphs
• Tight description of 4-paths in 3-polytopes with minimum degree 5
• Tight descriptions of 3-paths in normal plane maps
• Two variations of Franklin's theorem
• Weight of 3-paths in sparse plane graphs

Cited in

(8)

• A tight description of 3-polytopes by their major 3-paths
• All tight descriptions of major 3-paths in 3-polytopes without 3-vertices
• All tight descriptions of 3-paths in plane graphs with girth 8
• All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
• All tight descriptions of 3-paths in plane graphs with girth at least 7
• An analogue of Franklin's theorem
• Tight description of 4-paths in 3-polytopes with minimum degree 5
• Describing 4-paths in 3-polytopes with minimum degree 5

This page was built for publication: All tight descriptions of 4-paths in 3-polytopes with minimum degree 5

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2361076)