scientific article; zbMATH DE number 3390789
From MaRDI portal
Publication:5659560
zbMath0247.05113MaRDI QIDQ5659560
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (33)
The height of faces of 3-polytopes ⋮ 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 ⋮ Super cyclically edge-connected vertex-transitive graphs of girth at least 5 ⋮ Super-cyclically edge-connected regular graphs ⋮ Combinatorial structure of faces in triangulations on surfaces ⋮ On several sorts of connectivity ⋮ On the structure of essentially-highly-connected polyhedral graphs ⋮ Heights of minor faces in 3-polytopes ⋮ 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 ⋮ More about the height of faces in 3-polytopes ⋮ Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses ⋮ Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4 ⋮ On the reliability of modified bubble-sort graphs ⋮ Characterization of graphs with infinite cyclic edge connectivity ⋮ Some results about the reliability of folded hypercubes ⋮ On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs ⋮ On the weight of minor faces in triangle-free 3-polytopes ⋮ Heights of minor faces in triangle-free 3-polytopes ⋮ Atoms of cyclic edge connectivity in regular graphs ⋮ Low edges in 3-polytopes ⋮ Low minor faces in 3-polytopes ⋮ Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 ⋮ Tight description of faces in torus triangulations with minimum degree 5 ⋮ Describing faces in 3-polytopes with no vertices of degree from 5 to 7 ⋮ On cyclic edge-connectivity of transitive graphs
This page was built for publication:
