scientific article; zbMATH DE number 3541571
From MaRDI portal
Publication:4117038
zbMath0347.52004MaRDI QIDQ4117038
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enumeration in graph theory (05C30) Other designs, configurations (05B30) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (2) dimensions (including convex curves) (52A10) Polytopes and polyhedra (52Bxx)
Related Items (26)
On some metric and combinatorial geometric problems ⋮ All tight descriptions of 3-paths in plane graphs with girth at least 9 ⋮ Weight of edges in normal plane maps ⋮ On the maximum weight of a sparse connected graph of given order and size ⋮ Triangles with restricted degree sum of their boundary vertices in plane graphs ⋮ An extension of Kotzig's theorem ⋮ Refined weight of edges in normal plane maps ⋮ Subgraphs with restricted degrees of their vertices in planar 3-connected graphs ⋮ Many collinear \(k\)-tuples with no \(k+1\) collinear points ⋮ Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps ⋮ Geometria combinatoria e geometrie finite ⋮ All tight descriptions of 3-paths in plane graphs with girth 8 ⋮ Describing 3-paths in normal plane maps ⋮ Weight of 3-paths in sparse plane graphs ⋮ Optimal unavoidable sets of types of 3-paths for planar graphs of given girth ⋮ On the existence of specific stars in planar graphs ⋮ Strengthening of a theorem about 3-polytopes ⋮ Extending Kotzig's theorem ⋮ Light edges in 3-connected 2-planar graphs with prescribed minimum degree ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ Structure of edges in plane graphs with bounded dual edge weight ⋮ Extending two theorems of A. Kotzig ⋮ On light cycles in plane triangulations ⋮ Subgraphs with restricted degrees of their vertices in planar graphs ⋮ Describing tight descriptions of 3-paths in triangle-free normal plane maps ⋮ Tight Descriptions of 3‐Paths in Normal Plane Maps
This page was built for publication:
