Pages that link to "Item:Q4210671"
From MaRDI portal
The following pages link to Minimal vertex degree sum of a 3-path in plane maps (Q4210671):
Displaying 26 items.
- An analogue of Franklin's theorem (Q294562) (← links)
- Describing 3-paths in normal plane maps (Q394206) (← 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)
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices (Q898158) (← links)
- On light cycles in plane triangulations (Q1292852) (← links)
- On \(3\)-connected plane graphs without triangular faces (Q1569046) (← 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)
- Heavy paths, light stars, and big melons (Q1883260) (← links)
- A tight description of 3-polytopes by their major 3-paths (Q2030764) (← links)
- All tight descriptions of major 3-paths in 3-polytopes without 3-vertices (Q2033345) (← links)
- All tight descriptions of 3-paths in plane graphs with girth 8 (Q2182227) (← links)
- An extension of Franklin's theorem (Q2201015) (← links)
- Soft 3-stars in sparse plane graphs (Q2212724) (← 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)
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9 (Q4446881) (← links)
- Tight Descriptions of 3‐Paths in Normal Plane Maps (Q5272637) (← links)
- Light 3-paths in 3-polytopes without adjacent triangles (Q6203328) (← links)
