scientific article; zbMATH DE number 3504992
From MaRDI portal
Publication:4085741
zbMath0323.05104MaRDI QIDQ4085741
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (40)
The height of faces of 3-polytopes ⋮ Paths with restricted degrees of their vertices in planar graphs ⋮ A Steinberg-like approach to describing faces in 3-polytopes ⋮ The weight of faces in normal plane maps ⋮ Triangles with restricted degree sum of their boundary vertices in plane graphs ⋮ Another tight description of faces in plane triangulations with minimum degree 4 ⋮ On the covering cuts of c d (d\(\leq 5)\) ⋮ Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5 ⋮ Combinatorial structure of faces in triangulations on surfaces ⋮ Subgraphs with restricted degrees of their vertices in planar 3-connected graphs ⋮ Heights of minor faces in 3-polytopes ⋮ On doubly light triangles in plane graphs ⋮ Structural Properties of Planar Maps with the Minimal Degree 5 ⋮ 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 ⋮ Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 ⋮ Tight description of faces of triangulations on the torus ⋮ The vertex-face weight of edges in 3-polytopes ⋮ Weights of induced subgraphs in \(K_{1,r}\)-free graphs ⋮ A geometric connection to threshold logic via cubical lattices ⋮ Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4 ⋮ Unnamed Item ⋮ On the cut number problem for the 4, and 5-cubes ⋮ An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations ⋮ Strengthening of a theorem about 3-polytopes ⋮ On the cut-complexes of the 5-cube ⋮ Extending Kotzig's theorem ⋮ Unnamed Item ⋮ Heights of minor faces in triangle-free 3-polytopes ⋮ On the coverings of the \(d\)-cube for \(d\leq 6\) ⋮ Low minor faces in 3-polytopes ⋮ Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 ⋮ Unnamed Item ⋮ On \(3\)-connected plane graphs without triangular faces ⋮ Describing faces in 3-polytopes with no vertices of degree from 5 to 7 ⋮ On light cycles in plane triangulations ⋮ Inner diagonals of convex polytopes ⋮ Low faces of restricted degree in 3-polytopes ⋮ The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic
This page was built for publication:
