Describing 3-faces in 3-polytopes without adjacent triangles
From MaRDI portal
Cites work
- A Steinberg-like approach to describing faces in 3-polytopes
- A structural property of convex 3-polytopes
- An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations
- An introduction to the discharging method via graph coloring
- Circular \((5,2)\)-coloring of sparse graphs
- Colorings of plane graphs: a survey
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- scientific article; zbMATH DE number 1882356 (Why is no real title available?)
- scientific article; zbMATH DE number 889952 (Why is no real title available?)
- Light 3-faces in 3-polytopes without adjacent triangles
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- Light subgraphs of graphs embedded in the plane. A survey
- More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- Structural theorem on plane graphs with application to the entire coloring number
This page was built for publication: Describing 3-faces in 3-polytopes without adjacent triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7029351)
