The following pages link to (Q4085741):
Displaying 41 items.
- The weight of faces in normal plane maps (Q294568) (← links)
- On doubly light triangles in plane graphs (Q383767) (← links)
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (Q393180) (← links)
- Describing 3-faces in normal plane maps with minimum degree 4 (Q394234) (← links)
- Describing faces in plane triangulations (Q394346) (← links)
- Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5 (Q396738) (← links)
- Weights of induced subgraphs in \(K_{1,r}\)-free graphs (Q442341) (← links)
- Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4 (Q467650) (← links)
- On the cut-complexes of the 5-cube (Q582575) (← links)
- Extending Kotzig's theorem (Q585213) (← links)
- A geometric connection to threshold logic via cubical lattices (Q646706) (← links)
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 (Q748469) (← links)
- The vertex-face weight of edges in 3-polytopes (Q901903) (← links)
- On the coverings of the \(d\)-cube for \(d\leq 6\) (Q1003460) (← links)
- On the covering cuts of c d (d\(\leq 5)\) (Q1097520) (← links)
- Strengthening of a theorem about 3-polytopes (Q1214162) (← links)
- On light cycles in plane triangulations (Q1292852) (← links)
- Inner diagonals of convex polytopes (Q1296758) (← links)
- Triangles with restricted degree sum of their boundary vertices in plane graphs (Q1343775) (← links)
- Subgraphs with restricted degrees of their vertices in planar 3-connected graphs (Q1376060) (← links)
- On \(3\)-connected plane graphs without triangular faces (Q1569046) (← links)
- Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5 (Q1642298) (← links)
- Low minor faces in 3-polytopes (Q1800413) (← links)
- On the cut number problem for the 4, and 5-cubes (Q1983113) (← links)
- An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations (Q1999749) (← links)
- Another tight description of faces in plane triangulations with minimum degree 4 (Q2144510) (← links)
- Combinatorial structure of faces in triangulations on surfaces (Q2160180) (← links)
- Describing faces in 3-polytopes with no vertices of degree from 5 to 7 (Q2324509) (← links)
- Low faces of restricted degree in 3-polytopes (Q2332064) (← links)
- The height of faces of 3-polytopes (Q2360257) (← links)
- A Steinberg-like approach to describing faces in 3-polytopes (Q2361077) (← links)
- Heights of minor faces in 3-polytopes (Q2661738) (← links)
- The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic (Q3439143) (← links)
- (Q3662217) (← links)
- (Q3750651) (← links)
- Structural Properties of Planar Maps with the Minimal Degree 5 (Q4024455) (← links)
- (Q4289985) (← links)
- Paths with restricted degrees of their vertices in planar graphs (Q4783814) (← links)
- Heights of minor faces in triangle-free 3-polytopes (Q5963434) (← links)
- Tight description of faces of triangulations on the torus (Q6098092) (← links)
- On a convex geometric connection to threshold logic (Q6616807) (← links)
