Soft 3-stars in sparse plane graphs
From MaRDI portal
Recommendations
- Light 3-stars in sparse plane graphs
- Light 3-stars in embedded graphs
- Unavoidable stars in 3-graphs
- On the existence of specific stars in planar graphs
- Weight of 3-paths in sparse plane graphs
- The generalized 3-connectivity of star graphs and bubble-sort graphs
- On a class of graphs without 3-stars
- On 3-simplicial vertices in planar graphs
- 3-star factors in random d-regular graphs
- Representing triangulated graphs in stars
Cites work
- 5-stars of low weight in normal plane maps with minimum degree 5
- All tight descriptions of 3-stars in 3-polytopes with girth 5
- An analogue of Franklin'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 a class of 3-polytopes with minimum degree 5
- Describing short paths in plane graphs of girth at least 5
- Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7
- Light 3-stars in sparse plane graphs
- Light and low 5-stars in normal plane maps with minimum degree 5
- Light graphs in planar graphs of large girth
- Light subgraphs of graphs embedded in the plane. A survey
- Low 5-stars in normal plane maps with minimum degree 5
- Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
- Minimal vertex degree sum of a 3-path in plane maps
- 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
- Weight of 3-paths in sparse plane graphs
- Weight of edges in normal plane maps
Cited in
(4)
This page was built for publication: Soft 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 Q2212724)
