Pages that link to "Item:Q2334769"
From MaRDI portal
The following pages link to All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 (Q2334769):
Displaying 11 items.
- Describing short paths in plane graphs of girth at least 5 (Q472958) (← 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)
- 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)
- Note on 3-paths in plane graphs of girth 4 (Q2344794) (← links)
- All tight descriptions of 3-paths in plane graphs with girth at least 7 (Q2659247) (← links)
- Independent bondage number of planar graphs with minimum degree at least 3 (Q2675833) (← links)