Pages that link to "Item:Q2344794"

The following pages link to Note on 3-paths in plane graphs of girth 4 (Q2344794):

Displaying 17 items.

• 3-paths in graphs with bounded average degree (Q274685) (← links)
• An analogue of Franklin's theorem (Q294562) (← links)
• An extension of Kotzig's theorem (Q339478) (← 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)
• Light graphs in planar graphs of large girth (Q907844) (← 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)
• 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)
• All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 (Q2334769) (← 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)
• Tight Descriptions of 3‐Paths in Normal Plane Maps (Q5272637) (← links)