Light 3-stars in sparse plane graphs

Related Items (2)

3-vertices with fewest 2-neighbors in plane graphs with no long paths of 2-vertices ⋮ Soft 3-stars in sparse plane graphs

Cites Work

Unnamed Item
Weight of edges in normal plane maps
3-paths in graphs with bounded average degree
An analogue of Franklin's theorem
Light and low 5-stars in normal plane maps with minimum degree 5
An extension of Kotzig's theorem
Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
Describing 3-paths in normal plane maps
Describing short paths in plane graphs of girth at least 5
All tight descriptions of 3-stars in 3-polytopes with girth 5
Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
List injective colorings of planar graphs
Weight of 3-paths in sparse plane graphs
Optimal unavoidable sets of types of 3-paths for planar graphs of given girth
Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
Light graphs in planar graphs of large girth
Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
A structural property of convex 3-polytopes
Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5
Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices
Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7
Covering planar graphs with forests
Light subgraphs of graphs embedded in the plane. A survey
Note on 3-paths in plane graphs of girth 4
Describing tight descriptions of 3-paths in triangle-free normal plane maps
On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
Joint extension of two theorems of Kotzig on 3-polytopes
Low 5-stars in normal plane maps with minimum degree 5
Refined weight of edges in normal plane maps
On the existence of specific stars in planar graphs
5-stars of low weight in normal plane maps with minimum degree 5
Low edges in 3-polytopes
Light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
Quelques consequences simples de la formule d'Euler
On the total coloring of planar graphs.
Minimal vertex degree sum of a 3-path in plane maps
On light subgraphs in plane graphs of minimum degree five
On the structure of plane graphs of minimum face size 5
Paths with restricted degrees of their vertices in planar graphs
Coloring the square of a planar graph
Tight Descriptions of 3‐Paths in Normal Plane Maps

This page was built for publication: Light 3-stars in sparse plane graphs