Tight description of faces of triangulations on the torus
From MaRDI portal
Publication:6098092
DOI10.1016/J.DISC.2023.113510zbMATH Open1516.05042MaRDI QIDQ6098092FDOQ6098092
Authors: Oleg V. Borodin, Anna O. Ivanova 
Publication date: 12 June 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
- Tight description of faces in torus triangulations with minimum degree 5
- Another tight description of faces in plane triangulations with minimum degree 4
- Combinatorial structure of faces in triangulations on surfaces
- Describing faces in plane triangulations
- Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
Planar graphs; geometric and topological aspects of graph theory (05C10) Three-dimensional polytopes (52B10) Vertex degrees (05C07)
Cites Work
- Colorings of plane graphs: a survey
- Light subgraphs of graphs embedded in the plane. A survey
- Triangles with restricted degrees of their boundary vertices in plane triangulations
- Triangulated \(3\)-polytopes without faces of low weight
- Title not available (Why is that?)
- Describing 3-faces in normal plane maps with minimum degree 4
- Describing faces in plane triangulations
- Title not available (Why is that?)
- 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?)
- Tight description of faces in torus triangulations with minimum degree 5
- Combinatorial structure of faces in triangulations on surfaces
- Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
- Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
- An introduction to the discharging method via graph coloring
- An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations
Cited In (8)
- Extremal properties of plane homogeneous triangulations
- Describing faces in plane triangulations
- Tight description of faces in torus triangulations with minimum degree 5
- Another tight description of faces in plane triangulations with minimum degree 4
- Combinatorial structure of faces in triangulations on surfaces
- Polyhedral graphs with extreme numbers of types of faces
- There is no triangulation of the torus with vertex degrees \(5, 6, \dots , 6, 7\) and related results: geometric proofs for combinatorial theorems
- On the face touching number
This page was built for publication: Tight description of faces of triangulations on the torus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6098092)
