scientific article; zbMATH DE number 64356
From MaRDI portal
Publication:4013453
Recommendations
- Minimal reducible bounds for planar graphs
- On the minimal reducible bound for outerplanar and planar graphs
- Computing and Combinatorics
- New bounds on the edge number of ak-map graph
- A tight Erdős-Pósa function for planar minors
- A tight Erdős-Pósa function for planar minors
- Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
- Upper bounds on the graph minor theorem
Cited in
(16)- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- All tight descriptions of 3-paths in plane graphs with girth at least 9
- Light edges in degree-constrained graphs
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- Refined weight of edges in normal plane maps
- Weight of edges in normal plane maps
- An inequality concerning edges of minor weight in convex 3-polytopes
- scientific article; zbMATH DE number 4153483 (Why is no real title available?)
- scientific article; zbMATH DE number 3898916 (Why is no real title available?)
- Describing 3-paths in normal plane maps
- Structural Properties of Planar Maps with the Minimal Degree 5
- Computing and Combinatorics
- Paths with restricted degrees of their vertices in planar graphs
- scientific article; zbMATH DE number 870140 (Why is no real title available?)
- A tight Erdős-Pósa function for planar minors
- Tight descriptions of 3-paths in normal plane maps
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013453)