scientific article; zbMATH DE number 3390789

Cited in

(38)

On cyclic edge-connectivity of transitive graphs
Triangles with restricted degree sum of their boundary vertices in plane graphs
More about the height of faces in 3-polytopes
Low minor faces in 3-polytopes
Some results about the reliability of folded hypercubes
Tight description of faces in torus triangulations with minimum degree 5
Another tight description of faces in plane triangulations with minimum degree 4
Combinatorial structure of faces in triangulations on surfaces
On the structure of essentially-highly-connected polyhedral graphs
Describing faces in 3-polytopes with no vertices of degree from 5 to 7
The height of faces of 3-polytopes
A Steinberg-like approach to describing faces in 3-polytopes
Super cyclically edge-connected vertex-transitive graphs of girth at least 5
Super-cyclically edge-connected regular graphs
Characterization of graphs with infinite cyclic edge connectivity
Low edges in 3-polytopes
Heights of minor faces in 3-polytopes
Many-to-many edge-disjoint paths in (n,k)-enhanced hypercube under three link-faulty hypotheses
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
Light C₄ and C₅ in 3-polytopes with minimum degree 5
Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
On the reliability of modified bubble-sort graphs
On several sorts of connectivity
Heights of minor faces in triangle-free 3-polytopes
Atoms of cyclic edge connectivity in regular graphs
Tight description of faces of triangulations on the torus
On the super (edge)-connectivity of generalized Johnson graphs
Edge isoperimetric method for link fault tolerance of the complete Josephus cube under five models: a unified approach
All tight descriptions of faces in plane triangulations with minimum degree 4
Link fault tolerability of the Cartesian product power graph (K₉ -C₉)^n: conditional edge-connectivities under six link fault patterns
n-restricted edge connectivity of m-barrel fullerene graphs
On cyclic edge-connectivity and super-cyclic edge-connectivity of double-orbit graphs
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
The vertex-face weight of edges 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)