Pages that link to "Item:Q878637"
From MaRDI portal
The following pages link to The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5 (Q878637):
Displaying 22 items.
- An analogue of Franklin's theorem (Q294562) (← links)
- On doubly light triangles in plane graphs (Q383767) (← links)
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (Q393180) (← links)
- Describing 3-faces in normal plane maps with minimum degree 4 (Q394234) (← links)
- Describing faces in plane triangulations (Q394346) (← links)
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 (Q396738) (← links)
- All tight descriptions of 3-stars in 3-polytopes with girth 5 (Q505457) (← links)
- On the weight of minor faces in triangle-free 3-polytopes (Q726639) (← links)
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 (Q748469) (← links)
- The vertex-face weight of edges in 3-polytopes (Q901903) (← links)
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight (Q973139) (← links)
- On light cycles in plane triangulations (Q1292852) (← links)
- Low minor faces in 3-polytopes (Q1800413) (← links)
- Heavy paths, light stars, and big melons (Q1883260) (← links)
- An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations (Q1999749) (← links)
- On the structure of essentially-highly-connected polyhedral graphs (Q2172412) (← links)
- Low edges in 3-polytopes (Q2515562) (← links)
- Strongly light subgraphs in the 1-planar graphs with minimum degree 7 (Q2950081) (← links)
- On the Decay of Crossing Numbers of Sparse Graphs (Q3466340) (← links)
- Light paths in 4-connected graphs in the plane and other surfaces (Q4489492) (← links)
- (Q4518403) (← links)
- (Q5197596) (← links)
