Paths with restricted degrees of their vertices in planar graphs

DOI10.1023/A:1022411100562zbMath1003.05055MaRDI QIDQ4783814

Stanlislav Jendroľ

Publication date: 9 December 2002

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/30500

zbMATH Keywords

pathplanar graphdegree of vertices

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

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 ⋮ 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 ⋮ Subgraphs with restricted degrees of their vertices in planar 3-connected graphs ⋮ 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 ⋮ Light 3-paths in 3-polytopes without adjacent triangles ⋮ An extension of Franklin's theorem ⋮ Soft 3-stars in sparse plane graphs ⋮ On the existence of specific stars in planar graphs ⋮ Describing 4-paths in 3-polytopes with minimum degree 5 ⋮ Light paths in 4-connected graphs in the plane and other surfaces ⋮ 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 ⋮ Light paths with an odd number of vertices in polyhedral maps ⋮ All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\) ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending Kotzig's theorem
• Strengthening of a theorem about 3-polytopes
• Triangles with restricted degree sum of their boundary vertices in plane graphs
• On \(3\)-connected plane graphs without triangular faces
• Joint extension of two theorems of Kotzig on 3-polytopes
• Quelques consequences simples de la formule d'Euler
• On the total coloring of planar graphs.
• On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
• Unavoidable set of face types for planar maps
• Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
• Acyclic colorings of planar graphs
• Local structures in plane maps and distance colourings

This page was built for publication: Paths with restricted degrees of their vertices in planar graphs