Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
DOI10.1016/J.DISC.2013.04.026zbMATH Open1277.05044OpenAlexW103128652MaRDI QIDQ383686FDOQ383686
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.026
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10) Three-dimensional polytopes (52B10) Paths and cycles (05C38)
Cites Work
- Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
- Title not available (Why is that?)
- Light subgraphs of graphs embedded in the plane. A survey
- Joint extension of two theorems of Kotzig on 3-polytopes
- On the total coloring of planar graphs.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Triangles with restricted degrees of their boundary vertices in plane triangulations
- 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
- Title not available (Why is that?)
Cited In (19)
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5
- Soft 3-stars in sparse plane graphs
- Light 3-stars in sparse plane graphs
- An analogue of Franklin's theorem
- Describing 4-stars at 5-vertices in normal plane maps 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
- Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
- 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
- Tight descriptions of 3-paths in normal plane maps
- 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
- 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
- An introduction to the discharging method via graph coloring
- Describing 4-paths 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 \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383686)
