Pages that link to "Item:Q753827"
From MaRDI portal
The following pages link to Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs (Q753827):
Displaying 16 items.
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (Q393180) (← links)
- Green's theorem and isolation in planar graphs (Q714498) (← links)
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 (Q748469) (← links)
- Light graphs in families of outerplanar graphs (Q868354) (← links)
- More about the height of faces in 3-polytopes (Q1708391) (← links)
- Low minor faces in 3-polytopes (Q1800413) (← links)
- A tight description of 3-polytopes by their major 3-paths (Q2030764) (← links)
- Tight description of faces in torus triangulations with minimum degree 5 (Q2058357) (← links)
- Another tight description of faces in plane triangulations with minimum degree 4 (Q2144510) (← links)
- Combinatorial structure of faces in triangulations on surfaces (Q2160180) (← links)
- Describing faces in 3-polytopes with no vertices of degree from 5 to 7 (Q2324509) (← links)
- Heights of minor faces in 3-polytopes (Q2661738) (← links)
- (Q3469114) (← links)
- On Light Edges and Triangles in Planar Graphs of Minimum Degree Five (Q4321246) (← links)
- Minimal unavoidable sets of cycles in plane graphs (Q4561217) (← links)
- Tight description of faces of triangulations on the torus (Q6098092) (← links)
