Pages that link to "Item:Q888584"
From MaRDI portal
The following pages link to Weight of 3-paths in sparse plane graphs (Q888584):
Displayed 17 items.
- An analogue of Franklin's theorem (Q294562) (← links)
- Light subgraphs in graphs with average degree at most four (Q294570) (← links)
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 (Q727044) (← links)
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth (Q898139) (← 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)
- 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)
- 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices (Q2142641) (← 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)
- 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)