Unavoidable set of face types for planar maps
From MaRDI portal
Publication:4347588
DOI10.7151/DMGT.1028zbMath0877.05048OpenAlexW1967511920MaRDI QIDQ4347588
Mirko Horňák, Stanlislav Jendroľ
Publication date: 8 December 1997
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/fe86d524b522a805e20e598f60bdac0c56e09db4
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)
Related Items (24)
The height of faces of 3-polytopes ⋮ Paths with restricted degrees of their vertices in planar graphs ⋮ A Steinberg-like approach to describing faces in 3-polytopes ⋮ The weight of faces in normal plane maps ⋮ Another tight description of faces in plane triangulations with minimum degree 4 ⋮ Combinatorial structure of faces in triangulations on surfaces ⋮ Heights of minor faces in 3-polytopes ⋮ Describing 3-faces in normal plane maps with minimum degree 4 ⋮ Describing faces in plane triangulations ⋮ Tight description of faces of triangulations on the torus ⋮ The vertex-face weight of edges in 3-polytopes ⋮ More about the height of faces in 3-polytopes ⋮ A survey on the cyclic coloring and its relaxations ⋮ Unnamed Item ⋮ An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations ⋮ On the weight of minor faces in triangle-free 3-polytopes ⋮ Heights of minor faces in triangle-free 3-polytopes ⋮ Low edges in 3-polytopes ⋮ Low minor faces in 3-polytopes ⋮ Tight description of faces in torus triangulations with minimum degree 5 ⋮ A general upper bound for the cyclic chromatic number of 3‐connected plane graphs ⋮ Describing faces in 3-polytopes with no vertices of degree from 5 to 7 ⋮ Triangles with restricted degrees of their boundary vertices in plane triangulations ⋮ Low faces of restricted degree in 3-polytopes
This page was built for publication: Unavoidable set of face types for planar maps
