Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
From MaRDI portal
Publication:1376060
DOI10.1007/BF03353001zbMath0891.05025MaRDI QIDQ1376060
Igor Fabrici, Stanlislav Jendroľ
Publication date: 21 January 1998
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Related Items (28)
Light structures in infinite planar graphs without the strong isoperimetric property ⋮ Heavy paths, light stars, and big melons ⋮ On the Decay of Crossing Numbers of Sparse Graphs ⋮ 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 weights of induced paths and cycles in claw-free andK1,r-free graphs ⋮ Lightweight paths in graphs ⋮ Weights of induced subgraphs in \(K_{1,r}\)-free graphs ⋮ Subgraphs of graphs on surfaces with high representativity ⋮ Subgraphs with restricted degrees of their vertices in large polyhedral maps on compact two-manifolds ⋮ On the existence of specific stars in planar graphs ⋮ Light paths in 4-connected graphs in the plane and other surfaces ⋮ On large light graphs in families of polyhedral graphs ⋮ Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds ⋮ Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight ⋮ Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds ⋮ Connected subgraphs with small degree sums in 3-connected planar graphs ⋮ Light paths with an odd number of vertices in polyhedral maps ⋮ Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9 ⋮ Unnamed Item ⋮ On \(3\)-connected plane graphs without triangular faces ⋮ On light cycles in plane triangulations ⋮ Light paths with an odd number of vertices in large polyhedral maps ⋮ Subgraphs with restricted degrees of their vertices in planar graphs ⋮ Note on weights of paths in polyhedral graphs
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
