Recommendations
Cites work
- 3-paths in graphs with bounded average degree
- 5-stars of low weight in normal plane maps with minimum degree 5
- A structural property of convex 3-polytopes
- All tight descriptions of 3-stars in 3-polytopes with girth 5
- An analogue of Franklin's theorem
- An extension of Kotzig's theorem
- Coloring the square of a planar graph
- Covering planar graphs with forests
- Describing 3-paths in normal plane maps
- Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
- Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
- Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
- Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5
- Describing short paths in plane graphs of girth at least 5
- Describing tight descriptions of 3-paths in triangle-free normal plane maps
- Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7
- Joint extension of two theorems of Kotzig on 3-polytopes
- Light and low 5-stars in normal plane maps with minimum degree 5
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- Light graphs in planar graphs of large girth
- Light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
- Light subgraphs of graphs embedded in the plane. A survey
- List injective colorings of planar graphs
- Low 5-stars in normal plane maps with minimum degree 5
- Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices
- Low edges in 3-polytopes
- Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
- Minimal vertex degree sum of a 3-path in plane maps
- Note on 3-paths in plane graphs of girth 4
- On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
- On light subgraphs in plane graphs of minimum degree five
- On the existence of specific stars in planar graphs
- On the structure of plane graphs of minimum face size 5
- On the total coloring of planar graphs.
- Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
- Paths with restricted degrees of their vertices in planar graphs
- Quelques consequences simples de la formule d'Euler
- Refined weight of edges in normal plane maps
- Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
- Tight descriptions of 3-paths in normal plane maps
- Two variations of Franklin's theorem
- Weight of 3-paths in sparse plane graphs
- Weight of edges in normal plane maps
Cited in
(6)- Light 3-stars in embedded graphs
- 3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices
- Soft 3-stars in sparse plane graphs
- On the existence of specific stars in planar graphs
- All tight descriptions of 3-stars in 3-polytopes with girth 5
- Weight of 3-paths in sparse plane graphs
This page was built for publication: Light 3-stars in sparse plane graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2633370)
