scientific article; zbMATH DE number 3390789
From MaRDI portal
Publication:5659560
zbMATH Open0247.05113MaRDI QIDQ5659560FDOQ5659560
Publication date: 1972
Title of this publication is not available (Why is that?)
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (34)
- Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
- Low minor faces in 3-polytopes
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5
- Atoms of cyclic edge connectivity in regular graphs
- Low edges in 3-polytopes
- On the super (edge)-connectivity of generalized Johnson graphs
- The height of faces of 3-polytopes
- On the reliability of modified bubble-sort graphs
- Tight description of faces of triangulations on the torus
- Heights of minor faces in 3-polytopes
- Triangles with restricted degree sum of their boundary vertices in plane graphs
- On cyclic edge-connectivity of transitive graphs
- The vertex-face weight of edges in 3-polytopes
- On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs
- The weight of faces in normal plane maps
- 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
- Tight description of faces in torus triangulations with minimum degree 5
- On several sorts of connectivity
- Another tight description of faces in plane triangulations with minimum degree 4
- Combinatorial structure of faces in triangulations on surfaces
- Some results about the reliability of folded hypercubes
- On the weight of minor faces in triangle-free 3-polytopes
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15
- Super-cyclically edge-connected regular graphs
- Describing faces in 3-polytopes with no vertices of degree from 5 to 7
- A Steinberg-like approach to describing faces in 3-polytopes
- Super cyclically edge-connected vertex-transitive graphs of girth at least 5
- On the structure of essentially-highly-connected polyhedral graphs
- Characterization of graphs with infinite cyclic edge connectivity
- Heights of minor faces in triangle-free 3-polytopes
- Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses
- More about the height of faces in 3-polytopes
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 Q5659560)
