Subgraphs with restricted degrees of their vertices in planar 3-connected graphs

DOI10.1007/BF03353001zbMath0891.05025MaRDI QIDQ1376060

Igor Fabrici, Stanlislav Jendroľ

Publication date: 21 January 1998

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

zbMATH Keywords

degree; path; planar graph

Mathematics Subject Classification ID

05C38: Paths and cycles

05C10: Planar graphs; geometric and topological aspects of graph theory

Related Items

Connected subgraphs with small degree sums in 3-connected planar graphs, Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9, Light structures in infinite planar graphs without the strong isoperimetric property, Light paths in 4-connected graphs in the plane and other surfaces, Lightweight paths in graphs, Unnamed Item, Weights of induced subgraphs in \(K_{1,r}\)-free graphs, Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds, Four gravity results, The structure of 1-planar graphs, Light graphs in families of outerplanar graphs, Lightness, heaviness and gravity, The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5, On large light graphs in families of polyhedral graphs, Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight, On light cycles in plane triangulations, Light paths with an odd number of vertices in large polyhedral maps, Note on weights of paths in polyhedral graphs, Subgraphs of graphs on surfaces with high representativity, On \(3\)-connected plane graphs without triangular faces, Subgraphs with restricted degrees of their vertices in planar graphs, Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds, Heavy paths, light stars, and big melons, Subgraphs with restricted degrees of their vertices in large polyhedral maps on compact two-manifolds, On the existence of specific stars in planar graphs, On weights of induced paths and cycles in claw-free andK1,r-free graphs, Light paths with an odd number of vertices in polyhedral maps, On the Decay of Crossing Numbers of Sparse Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extending Kotzig's theorem
• Strengthening of a theorem about 3-polytopes
• A structural property of convex 3-polytopes
• On the total coloring of planar graphs.
• Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
• Paths with restricted degrees of their vertices in planar graphs