Light 3-faces in 3-polytopes without adjacent triangles
From MaRDI portal
Publication:6635125
DOI10.1016/J.DISC.2024.114299MaRDI QIDQ6635125
Publication date: 9 November 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22) Density (toughness, etc.) (05C42)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An introduction to the discharging method via graph coloring
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
- A structural property of convex 3-polytopes
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- 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
- A Steinberg-like approach to describing faces in 3-polytopes
- Circular \((5,2)\)-coloring of sparse graphs
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
- More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges
- Structural theorem on plane graphs with application to the entire coloring number
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
This page was built for publication: Light 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 Q6635125)
