Describing (d-2)-stars at d-vertices, d 5, in normal plane maps

DOI10.1016/J.DISC.2013.04.026MaRDI QIDQ383686zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

normal plane mapplane graphstarweight

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Three-dimensional polytopes (52B10)

Recommendations

• Low 5-stars in normal plane maps with minimum degree 5
• Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
• Describing 3-paths in normal plane maps
• Height of 5-stars in normal plane maps with minimum degree 5
• 5-stars of low weight in normal plane maps with minimum degree 5

Cites work

• Coloring the square of a planar graph
• Covering planar graphs with forests
• scientific article; zbMATH DE number 4047751 (Why is no real title available?)
• scientific article; zbMATH DE number 30974 (Why is no real title available?)
• scientific article; zbMATH DE number 3541571 (Why is no real title available?)
• scientific article; zbMATH DE number 1342018 (Why is no real title available?)
• Joint extension of two theorems of Kotzig on 3-polytopes
• Light subgraphs of graphs embedded in the plane. A survey
• On light subgraphs in plane graphs of minimum degree five
• 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
• Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
• Triangles with restricted degrees of their boundary vertices in plane triangulations

Cited in

(19)

• 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
• Soft 3-stars in sparse plane graphs
• Note on 3-paths in plane graphs of girth 4
• All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
• 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
• An analogue of Franklin's theorem
• Light and low 5-stars in normal plane maps with minimum degree 5
• Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
• Light C₄ and C₅ in 3-polytopes with minimum degree 5
• 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
• Tight descriptions of 3-paths in normal plane maps
• Low stars in normal plane maps with minimum degree 4 and no adjacent 4-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)