scientific article; zbMATH DE number 3217679
From MaRDI portal
Publication:5344765
Cited in
(48)- Structural Properties of Planar Maps with the Minimal Degree 5
- Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
- On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
- A Steinberg-like approach to describing faces in 3-polytopes
- Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
- Low faces of restricted degree in 3-polytopes
- Heights of minor faces in 3-polytopes
- scientific article; zbMATH DE number 4212106 (Why is no real title available?)
- Another tight description of faces in plane triangulations with minimum degree 4
- k-valent maps on the surfaces
- On quadrangular convex 3-polytopes with at most two types of edges
- Triangulated \(3\)-polytopes without faces of low weight
- Combinatorial structure of faces in triangulations on surfaces
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
- Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
- scientific article; zbMATH DE number 97631 (Why is no real title available?)
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5
- The game coloring number of planar graphs
- Tight description of faces in torus triangulations with minimum degree 5
- Low edges in 3-polytopes
- Triangles with restricted degree sum of their boundary vertices in plane graphs
- Extending two theorems of A. Kotzig
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
- Describing 3-faces in normal plane maps with minimum degree 4
- Describing faces in plane triangulations
- On light cycles in plane triangulations
- More about the height of faces in 3-polytopes
- Note on inscribability of quadrangular polyhedra with restricted number of edge-types
- Lightness of digraphs in surfaces and directed game chromatic number
- The vertex-face weight of edges in 3-polytopes
- Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
- Describing faces in 3-polytopes with no vertices of degree from 5 to 7
- 5-stars of low weight in normal plane maps with minimum degree 5
- Low minor faces in 3-polytopes
- On a problem of J. Zaks concerning 5-valent 3-connected planar graphs
- Paths with restricted degrees of their vertices in planar graphs
- Joint extension of two theorems of Kotzig on 3-polytopes
- Tight description of faces of triangulations on the torus
- An extension of Kotzig's theorem
- Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5
- The weight of faces in normal plane maps
- Height of minor faces in plane normal maps
- On the weight of minor faces in triangle-free 3-polytopes
- The method of coloring in graphs and its application
- The height of faces of 3-polytopes
- Heights of minor faces in triangle-free 3-polytopes
- An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations
- Convex 3-polytopes with exactly two types of edges
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 Q5344765)