Pages that link to "Item:Q898139"

The following pages link to Optimal unavoidable sets of types of 3-paths for planar graphs of given girth (Q898139):

Displaying 11 items.

• Light subgraphs in graphs with average degree at most four (Q294570) (← 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)
• All one-term tight descriptions of 3-paths in normal plane maps without \(K_4 - e\) (Q1800414) (← links)
• Light 3-stars in embedded graphs (Q2111915) (← 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)
• Soft 3-stars in sparse plane graphs (Q2212724) (← links)
• All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6 (Q2334769) (← 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)