Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
From MaRDI portal
Publication:383686
DOI10.1016/j.disc.2013.04.026zbMath1277.05044OpenAlexW103128652MaRDI QIDQ383686
Anna O. Ivanova, Oleg V. Borodin
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.026
Three-dimensional polytopes (52B10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (19)
All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ An analogue of Franklin's theorem ⋮ Low 5-stars 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 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 ⋮ Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5 ⋮ Light \(C_4\) and \(C_5\) in 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 ⋮ Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices ⋮ Soft 3-stars in sparse plane graphs ⋮ Minor stars in plane graphs with minimum degree five ⋮ An introduction to the discharging method via graph coloring ⋮ Describing 4-paths in 3-polytopes with minimum degree 5 ⋮ Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices ⋮ 5-stars of low weight in normal plane maps with minimum degree 5 ⋮ Note on 3-paths in plane graphs of girth 4 ⋮ Tight Descriptions of 3‐Paths in Normal Plane Maps
Cites Work
- Triangles with restricted degrees of their boundary vertices in plane triangulations
- Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
- Covering planar graphs with forests
- Light subgraphs of graphs embedded in the plane. A survey
- Joint extension of two theorems of Kotzig on 3-polytopes
- On the existence of specific stars in planar graphs
- On the total coloring of planar graphs.
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
