Pages that link to "Item:Q1937552"
From MaRDI portal
The following pages link to Light subgraphs of graphs embedded in the plane. A survey (Q1937552):
Displaying 50 items.
- Weight of edges in normal plane maps (Q271617) (← links)
- An analogue of Franklin's theorem (Q294562) (← links)
- The weight of faces in normal plane maps (Q294568) (← links)
- Light subgraphs in graphs with average degree at most four (Q294570) (← links)
- Strong isoperimetric inequalities and combinatorial curvatures on multiply connected planar graphs (Q331372) (← links)
- An extension of Kotzig's theorem (Q339478) (← links)
- Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps (Q383686) (← links)
- Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5 (Q383687) (← 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)
- On the maximum weight of a planar graph of given order and size (Q406330) (← links)
- Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4 (Q467650) (← links)
- Describing short paths in plane graphs of girth at least 5 (Q472958) (← links)
- All tight descriptions of 3-stars in 3-polytopes with girth 5 (Q505457) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Describing 4-paths in 3-polytopes with minimum degree 5 (Q511329) (← links)
- Light edges in 3-connected 2-planar graphs with prescribed minimum degree (Q723598) (← links)
- On the weight of minor faces in triangle-free 3-polytopes (Q726639) (← links)
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 (Q727044) (← links)
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 (Q748469) (← links)
- The structure of 1-planar graphs (Q868353) (← links)
- Light graphs in families of outerplanar graphs (Q868354) (← links)
- Lightness, heaviness and gravity (Q868366) (← links)
- The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5 (Q878637) (← links)
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth (Q898139) (← links)
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices (Q898158) (← links)
- The vertex-face weight of edges in 3-polytopes (Q901903) (← links)
- Split Euler tours in 4-regular planar graphs (Q907827) (← links)
- Light graphs in planar graphs of large girth (Q907844) (← links)
- On large light graphs in families of polyhedral graphs (Q960946) (← links)
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight (Q973139) (← links)
- On light graphs in the family of 4-connected planar graphs (Q1613473) (← 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)
- More about the height of faces in 3-polytopes (Q1708391) (← links)
- Minor stars in plane graphs with minimum degree five (Q1730241) (← links)
- Light paths and edges in families of outer-1-planar graphs (Q1751428) (← links)
- A study on oriented relative clique number (Q1752681) (← links)
- Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds (Q1767631) (← 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)
- A tight description of 3-polytopes by their major 3-paths (Q2030764) (← links)
- Structure of edges in plane graphs with bounded dual edge weight (Q2032903) (← links)
- All tight descriptions of major 3-paths in 3-polytopes without 3-vertices (Q2033345) (← links)
- Tight description of faces in torus triangulations with minimum degree 5 (Q2058357) (← links)
- On clique numbers of colored mixed graphs (Q2097162) (← links)
- Light 3-stars in embedded graphs (Q2111915) (← links)