Pages that link to "Item:Q5272637"

The following pages link to Tight Descriptions of 3‐Paths in Normal Plane Maps (Q5272637):

Displaying 13 items.

• An analogue of Franklin's theorem (Q294562) (← links)
• Light subgraphs in graphs with average degree at most four (Q294570) (← 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)
• 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)
• All tight descriptions of 3-paths in plane graphs with girth 8 (Q2182227) (← links)
• An extension of Franklin's theorem (Q2201015) (← 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)
• 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)