Subgraphs with restricted degrees of their vertices in planar graphs
From MaRDI portal
Publication:1584434
DOI10.1016/S0012-365X(98)00095-8zbMath0956.05059MaRDI QIDQ1584434
Igor Fabrici, Stanlislav Jendroľ
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (7)
On weights of induced paths and cycles in claw-free andK1,r-free graphs ⋮ Weights of induced subgraphs in \(K_{1,r}\)-free graphs ⋮ Subgraphs with restricted degrees of their vertices in large polyhedral maps on compact two-manifolds ⋮ Light paths in 4-connected graphs in the plane and other surfaces ⋮ Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds ⋮ On \(3\)-connected plane graphs without triangular faces ⋮ Note on weights of paths in polyhedral graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extending Kotzig's theorem
- Strengthening of a theorem about 3-polytopes
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- A structural property of convex 3-polytopes
- On the total coloring of planar graphs.
- Matchings in polytopal graphs
- Connected subgraphs with small degree sums in 3-connected planar graphs
- Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
This page was built for publication: Subgraphs with restricted degrees of their vertices in planar graphs
