Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
From MaRDI portal
Publication:383687
DOI10.1016/J.DISC.2013.04.025zbMATH Open1277.05144OpenAlexW2053129487MaRDI QIDQ383687FDOQ383687
Authors: Oleg V. Borodin, Anna O. Ivanova
Publication date: 5 December 2013
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.04.025
Recommendations
- 5-stars of low weight in normal plane maps with minimum degree 5
- Light and low 5-stars in normal plane maps with minimum degree 5
- Height of 5-stars in normal plane maps with minimum degree 5
- Low 5-stars in normal plane maps with minimum degree 5
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
- Light subgraphs of graphs embedded in the plane. A survey
- 5-stars of low weight in normal plane maps with minimum degree 5
- Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
- Structural Properties of Planar Maps with the Minimal Degree 5
- Short cycles of low weight in normal plane maps with minimum degree 5
- On light subgraphs in plane graphs of minimum degree five
- Coloring the square of a planar graph
- Covering planar graphs with forests
- On the existence of specific stars in planar graphs
- The structure of the planar triangulations in terms of bundles and stars
- Title not available (Why is that?)
Cited In (28)
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5
- Soft 3-stars in sparse plane graphs
- Describing minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 or 7
- Almost all about light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
- Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9
- Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8
- Light 3-stars in sparse plane graphs
- An analogue of Franklin's theorem
- Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
- Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5
- Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7
- Light and low 5-stars in normal plane maps with minimum degree 5
- The structure of neighborhoods of 5-vertices in normal plane maps 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
- On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5
- Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices
- Note on 3-paths in plane graphs of girth 4
- Low and light 5-stars in 3-polytopes with minimum degree 5 and restrictions on the degrees of major vertices
- Minor stars in plane graphs with minimum degree five
- Height of 5-stars in normal plane maps with minimum degree 5
- All tight descriptions of 3-stars in 3-polytopes with girth 5
- All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
- 5-stars of low weight in normal plane maps with minimum degree 5
- Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices
- Describing 4-paths in 3-polytopes with minimum degree 5
- Light minor 5-stars in 3-polytopes with minimum degree 5
- 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
This page was built for publication: Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383687)