scientific article; zbMATH DE number 30974
From MaRDI portal
Publication:3987221
Recommendations
Cited in
(28)- Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
- Triangles with restricted degrees of their boundary vertices in plane triangulations
- On the \(d\)-distance face chromatic number of plane graphs
- Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
- More about the height of faces in 3-polytopes
- Low minor faces in 3-polytopes
- An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations
- The height of faces of 3-polytopes
- Joint extension of two theorems of Kotzig on 3-polytopes
- Low 5-stars in normal plane maps with minimum degree 5
- Refined weight of edges in normal plane maps
- Low edges in 3-polytopes
- Heights of minor faces in 3-polytopes
- Weight of edges in normal plane maps
- The weight of faces in normal plane maps
- An extension of Kotzig's theorem
- Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
- Describing 3-faces in normal plane maps with minimum degree 4
- Describing faces in plane triangulations
- Heights of minor faces in triangle-free 3-polytopes
- Hyperbolic punctured spheres without arithmetic systole maximizers
- Describing edges in normal plane maps having no adjacent 3-faces
- Description of edges incident to 3-faces in 3-polytopes without adjacent 3-faces
- On the weight of minor faces in triangle-free 3-polytopes
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27
- Weight of 3-paths in sparse plane graphs
- The vertex-face weight of edges in 3-polytopes
- Light graphs in families of polyhedral graphs with prescribed minimum degree, face size, edge and dual edge weight
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3987221)
