Subgraphs with restricted degrees of their vertices in planar graphs
From MaRDI portal
Publication:1584434
DOI10.1016/S0012-365X(98)00095-8zbMATH Open0956.05059MaRDI QIDQ1584434FDOQ1584434
Authors: Igor Fabrici, Stanislav Jendroľ 
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- On vertex-degree restricted subgraphs in polyhedral graphs
- Paths with restricted degrees of their vertices in planar graphs
- On the frequency of 3-connected subgraphs of planar graphs
- On vertex-degree restricted paths in polyhedral graphs
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)
Cites Work
- Graph theory
- A structural property of convex 3-polytopes
- On the total coloring of planar graphs.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extending Kotzig's theorem
- Analogues for Tilings of Kotzig'S Theorem on Minimal Weights of Edges
- Strengthening of a theorem about 3-polytopes
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- Connected subgraphs with small degree sums in 3-connected planar graphs
- Matchings in polytopal graphs
Cited In (26)
- Maximum planar subgraphs in dense graphs
- The \(k\)-subconnectedness of planar graphs
- Note on weights of paths in polyhedral graphs
- 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
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs
- Connecting face hitting sets in planar graphs
- Title not available (Why is that?)
- Finite rigid subgraphs of pants graphs
- Weights of induced subgraphs in \(K_{1,r}\)-free graphs
- \([2,3]\)-factors in a 3-connected infinite planar graph.
- On the frequency of 3-connected subgraphs of planar graphs
- Subgraphs with restricted degrees of their vertices in large polyhedral maps on compact two-manifolds
- On \(3\)-connected plane graphs without triangular faces
- Note on vertex degrees of planar graphs
- The Planar Slope Number of Subcubic Graphs
- Large planar subgraphs in dense graphs
- Degree constrained subgraphs
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- Title not available (Why is that?)
- On 3-simplicial vertices in planar graphs
- On vertex-degree restricted paths in polyhedral graphs
- On weights of induced paths and cycles in claw-free and \(K_{1,r}\)-free graphs
- On vertex-degree restricted subgraphs in polyhedral graphs
- Planar graphs with few vertices of small degree
- On the existence of specific stars in planar graphs
This page was built for publication: Subgraphs with restricted degrees of their vertices in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584434)
