On the existence of specific stars in planar graphs
Given a graph \(G\), a \((k;a,b,c)\)-star in \(G\) is a subgraph isomorphic to a star \(K_{1,3}\) with a central vertex of degree \(k\) and three leaves of degrees \(a\), \(b\) and \(c\) in \(G\). The main result of the paper is: Every planar graph \(G\) of minimum degree at least 3 contains a \((k;a,b,c)\)-star with \(a \leq b \leq c\) and (i) \(k=3\), \(a \leq 10\), or (ii) \(k=4\), \(a=4\), \(4 \leq b \leq 10\), or (iii) \(k=4\), \(a=5\), \(5 \leq b \leq 9\), or (iv) \(k=4\), \(6 \leq a \leq 7\), \(6 \leq b \leq 8\), or (v) \(k=5\), \(4 \leq a \leq 5\), \(5 \leq b \leq 6\) and \(5 \leq c \leq 7\), or (vi) \(k=5\) and \(a=b=c=6\).
- A bound on the chromatic number of the square of a planar graph
- A Kotzig type theorem for non-orientable surfaces
- Coloring squares of planar graphs with girth six
- Coloring the square of a planar graph
- Connected subgraphs with small degree sums in 3-connected planar graphs
- Covering planar graphs with forests
- scientific article; zbMATH DE number 125461 (Why is no real title available?)
- scientific article; zbMATH DE number 3541571 (Why is no real title available?)
- scientific article; zbMATH DE number 1943979 (Why is no real title available?)
- Light paths in 4-connected graphs in the plane and other surfaces
- Light subgraphs of graphs embedded in the plane. A survey
- Note on an existence of small degree vertices with at most one big degree neighbour in planar graphs
- On a max-min problem concerning weights of edges
- On light subgraphs in plane graphs of minimum degree five
- Paths of low weight in planar graphs
- Paths with restricted degrees of their vertices in planar graphs
- Quelques consequences simples de la formule d'Euler
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
- 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
- Minor stars in plane graphs with minimum degree five
- Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
- Soft 3-stars in sparse plane graphs
- Light minor 5-stars in 3-polytopes with minimum degree 5
- Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8
- Low 5-stars in normal plane maps with minimum degree 5
- 5-stars of low weight in normal plane maps with minimum degree 5
- Light 3-stars in sparse plane graphs
- Light and low 5-stars in normal plane maps with minimum degree 5
- Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
- Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
- On the structure of plane graphs of minimum face size 5
- On 3-simplicial vertices in planar graphs
- Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
- Bounding clique size in squares of planar graphs
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
This page was built for publication: On the existence of specific stars in planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464048)
