The following pages link to Jin Akiyama (Q376525):
Displaying 50 items.
- On the diagonal weights of inscribed polytopes (Q376527) (← links)
- Determination of the element numbers of the regular polytopes (Q438929) (← links)
- Factors and factorizations of graphs. Proof techniques in factor theory (Q547467) (← links)
- Arrangements of \(n\) points whose incident-line-numbers are at most \(n/2\) (Q659700) (← links)
- A decision algorithm for reversible pairs of polygons (Q741530) (← links)
- Packing paths perfectly (Q757434) (← links)
- Simple alternating path problem (Q912861) (← links)
- A note on balanced colourings for lattice points (Q914694) (← links)
- Eccentric graphs (Q1066166) (← links)
- Maximum induced forests of planar graphs (Q1107540) (← links)
- Packing smaller graphs into a graph (Q1123906) (← links)
- A graph and its complement with specified properties. VI: Chromatic and achromatic numbers (Q1132109) (← links)
- The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests (Q1132898) (← links)
- A graph and its complement with specified properties. III: Girth and circumference (Q1142784) (← links)
- Further results on graph equations for line graphs and \(n\)-th power graphs (Q1153931) (← links)
- Regular graphs containing a given graph (Q1155628) (← links)
- Balancing signed graphs (Q1156154) (← links)
- A graph and its complement with specified properties. I: Connectivity (Q1258310) (← links)
- Graphs \(G\) for which both \(G\) and \(\overline {G}\) are contraction critically \(k\)-connected (Q1865622) (← links)
- The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square (Q1869738) (← links)
- A problem on hinged dissections with colours (Q1889823) (← links)
- On circles containing the maximum number of points (Q1916370) (← links)
- A prettier shell on the seashore: the Conway criterion (Q2153985) (← links)
- Twenty years of progress of \(\mathrm{JCDCG}^3\) (Q2308489) (← links)
- Polyhedral characterization of reversible hinged dissections (Q2308491) (← links)
- Unfoldings of an envelope (Q2311344) (← links)
- A criterion for a pair of convex polygons to be reversible (Q2345508) (← links)
- Reversibility and foldability of Conway tiles (Q2398822) (← links)
- Generalization of Haberdasher's puzzle (Q2408185) (← links)
- The element number of the convex regular polytopes (Q2430730) (← links)
- Convex developments of a regular tetrahedron (Q2489543) (← links)
- Operators which Preserve Reversibility (Q2864323) (← links)
- A note on the existence of a universal polytope among regular 4-polytopes (Q2866522) (← links)
- Reversible Nets of Polyhedra (Q2958083) (← links)
- A graph and its complement with specified properties. IV. Counting self-complementary blocks (Q3050460) (← links)
- Determination of All Tessellation Polyhedra with Regular Polygonal Faces (Q3098060) (← links)
- (Q3222237) (← links)
- (Q3337484) (← links)
- (Q3342617) (← links)
- Treks into Intuitive Geometry (Q3451152) (← links)
- Infinite Series of Generalized Gosper Space Filling Curves (Q3595443) (← links)
- Universal Measuring Boxes with Triangular Bases (Q3606564) (← links)
- (Q3680876) (← links)
- (Q3701441) (← links)
- Factors and factorizations of graphs—a survey (Q3714113) (← links)
- On the size of graphs with complete-factors (Q3722537) (← links)
- (Q3781119) (← links)
- A graph and its complement with specified properties V: The self‐complement index (Q3863925) (← links)
- (Q3882489) (← links)
- (Q3907606) (← links)
