Combinatorial structure of faces in triangulations on surfaces
From MaRDI portal
Publication:2160180
DOI10.1134/S0037446622040061zbMath1494.05024OpenAlexW4288060972MaRDI QIDQ2160180
Anna O. Ivanova, Oleg V. Borodin
Publication date: 3 August 2022
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0037446622040061
Extremal problems in graph theory (05C35) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Describing 3-faces in normal plane maps with minimum degree 4
- Describing faces in plane triangulations
- Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
- Triangles with restricted degrees of their boundary vertices in plane triangulations
- Triangulated \(3\)-polytopes without faces of low weight
- Light subgraphs of graphs embedded in the plane. A survey
- Colorings of plane graphs: a survey
- An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations
- Tight description of faces in torus triangulations with minimum degree 5
- Quelques consequences simples de la formule d'Euler
- Unavoidable set of face types for planar maps
- Light subgraphs in planar graphs of minimum degree 4 and edge‐degree 9
This page was built for publication: Combinatorial structure of faces in triangulations on surfaces