Describing faces in plane triangulations
From MaRDI portal
Publication:394346
DOI10.1016/J.DISC.2013.11.021zbMATH Open1280.05027OpenAlexW1972670378MaRDI QIDQ394346FDOQ394346
Alexandr Kostochka, Oleg V. Borodin, Anna O. Ivanova
Publication date: 27 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.11.021
Recommendations
- A Steinberg-like approach to describing faces in 3-polytopes
- scientific article; zbMATH DE number 1263244
- Describing 3-faces in normal plane maps with minimum degree 4
- Combinatorial structure of faces in triangulations on surfaces
- Computing a Face in an Arrangement of Line Segments and Related Problems
- Another tight description of faces in plane triangulations with minimum degree 4
- Computing Many Faces in Arrangements of Lines and Segments
- Tight description of faces of triangulations on the torus
- Face enumeration-from spheres to manifolds
Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22)
Cites Work
- Colorings of plane graphs: a survey
- Light subgraphs of graphs embedded in the plane. A survey
- Title not available (Why is that?)
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- Triangles with restricted degrees of their boundary vertices in plane triangulations
- Triangulated \(3\)-polytopes without faces of low weight
- Cyclic degrees of 3-polytopes
- Weight of faces in plane maps
- Title not available (Why is that?)
- Title not available (Why is that?)
- Describing 3-faces in normal plane maps with minimum degree 4
- Title not available (Why is that?)
- Title not available (Why is that?)
- Height of minor faces in plane normal maps
- Unavoidable set of face types for planar maps
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The 7-cycle \(C_{7}\) is light in the family of planar graphs with minimum degree 5
- Cyclic coloration of 3-polytopes
- Heavy paths, light stars, and big melons
- On the structure of polyhedral graphs with prescribed edge and dual edge weight
- Triangles with restricted degree sum of their boundary vertices in plane graphs
Cited In (25)
- Low minor faces in 3-polytopes
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5
- Low edges in 3-polytopes
- The height of faces of 3-polytopes
- Tight description of faces of triangulations on the torus
- An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations
- Computation and use of planar face normals
- Low faces of restricted degree in 3-polytopes
- Heights of minor faces in 3-polytopes
- The vertex-face weight of edges in 3-polytopes
- An analogue of Franklin's theorem
- The weight of faces in normal plane maps
- Tight Descriptions of 3‐Paths in Normal Plane Maps
- Describing 3-faces in normal plane maps with minimum degree 4
- Tight description of faces in torus triangulations with minimum degree 5
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
- Another tight description of faces in plane triangulations with minimum degree 4
- Combinatorial structure of faces in triangulations on surfaces
- On the weight of minor faces in triangle-free 3-polytopes
- Describing faces in 3-polytopes with no vertices of degree from 5 to 7
- A Steinberg-like approach to describing faces in 3-polytopes
- Note on 3-paths in plane graphs of girth 4
- Heights of minor faces in triangle-free 3-polytopes
- Describing 4-paths in 3-polytopes with minimum degree 5
- More about the height of faces in 3-polytopes
This page was built for publication: Describing faces in plane triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394346)
