Pages that link to "Item:Q1376488"
From MaRDI portal
The following pages link to A structural property of convex 3-polytopes (Q1376488):
Displaying 36 items.
- 3-paths in graphs with bounded average degree (Q274685) (← links)
- An analogue of Franklin's theorem (Q294562) (← links)
- Light subgraphs in graphs with average degree at most four (Q294570) (← links)
- Describing 3-paths in normal plane maps (Q394206) (← links)
- Describing short paths in plane graphs of girth at least 5 (Q472958) (← links)
- Describing 4-paths in 3-polytopes with minimum degree 5 (Q511329) (← links)
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 (Q727044) (← links)
- Lightness, heaviness and gravity (Q868366) (← links)
- Weight of 3-paths in sparse plane graphs (Q888584) (← links)
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth (Q898139) (← links)
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices (Q898158) (← links)
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs (Q1376060) (← links)
- On \(3\)-connected plane graphs without triangular faces (Q1569046) (← links)
- Subgraphs with restricted degrees of their vertices in planar graphs (Q1584434) (← links)
- All tight descriptions of 3-paths in plane graphs with girth at least 9 (Q1615748) (← links)
- Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11 (Q1649896) (← links)
- All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\) (Q1800414) (← links)
- Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7 (Q2118242) (← links)
- All tight descriptions of 3-paths in plane graphs with girth 8 (Q2182227) (← links)
- Light minor 5-stars in 3-polytopes with minimum degree 5 (Q2313297) (← links)
- Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8 (Q2319728) (← links)
- All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 (Q2334769) (← links)
- Note on 3-paths in plane graphs of girth 4 (Q2344794) (← links)
- Describing tight descriptions of 3-paths in triangle-free normal plane maps (Q2352059) (← links)
- All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 (Q2361076) (← links)
- Low 5-stars in normal plane maps with minimum degree 5 (Q2374153) (← links)
- Light 3-stars in sparse plane graphs (Q2633370) (← links)
- All tight descriptions of 3-paths in plane graphs with girth at least 7 (Q2659247) (← links)
- (Q3553169) (← links)
- (Q4328190) (← links)
- (Q4436188) (← links)
- Light paths in 4-connected graphs in the plane and other surfaces (Q4489492) (← links)
- Tight Descriptions of 3‐Paths in Normal Plane Maps (Q5272637) (← links)
- Light 3-paths in 3-polytopes without adjacent triangles (Q6203328) (← links)
- Light 3-faces in 3-polytopes without adjacent triangles (Q6635125) (← links)
- On the faces of unigraphic 3-polytopes (Q6655703) (← links)
