Jin Akiyama

From MaRDI portal
Revision as of 02:09, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:376525

Available identifiers

zbMath Open akiyama.jinWikidataQ11594937 ScholiaQ11594937MaRDI QIDQ376525

List of research outcomes





PublicationDate of PublicationType
Determination of all graphs whose eccentric graphs are clusters2025-01-22Paper
https://portal.mardi4nfdi.de/entity/Q61265182024-04-09Paper
https://portal.mardi4nfdi.de/entity/Q61504602024-03-06Paper
A prettier shell on the seashore: the Conway criterion2022-07-13Paper
Twenty years of progress of \(\mathrm{JCDCG}^3\)2020-04-03Paper
Polyhedral characterization of reversible hinged dissections2020-04-03Paper
Unfoldings of an envelope2019-07-10Paper
Only Isotetrahedra Can Be Stampers2019-02-18Paper
Generalization of Haberdasher's puzzle2017-10-10Paper
Reversibility and foldability of Conway tiles2017-08-21Paper
Reversible Nets of Polyhedra2017-02-01Paper
Treks into Intuitive Geometry2015-11-10Paper
Atoms for Parallelohedra2015-06-24Paper
A criterion for a pair of convex polygons to be reversible2015-05-22Paper
A decision algorithm for reversible pairs of polygons2014-09-12Paper
Tessellabilities, Reversibilities, and Decomposabilities of Polytopes2014-04-16Paper
A NOTE ON THE EXISTENCE OF A UNIVERSAL POLYTOPE AMONG REGULAR 4-POLYTOPES2013-12-13Paper
Operators which Preserve Reversibility2013-12-06Paper
On the diagonal weights of inscribed polytopes2013-11-05Paper
https://portal.mardi4nfdi.de/entity/Q49101172013-03-25Paper
On Reversibility among Parallelohedra2013-01-07Paper
Determination of the element numbers of the regular polytopes2012-07-31Paper
Arrangements of \(n\) points whose incident-line-numbers are at most \(n/2\)2012-01-24Paper
Determination of All Tessellation Polyhedra with Regular Polygonal Faces2011-11-11Paper
Factors and factorizations of graphs. Proof techniques in factor theory2011-07-01Paper
The element number of the convex regular polytopes2011-04-08Paper
Discrete and Computational Geometry2010-02-05Paper
Discrete and Computational Geometry2010-02-05Paper
Discrete and Computational Geometry2010-02-05Paper
Universal Measuring Boxes with Triangular Bases2009-02-26Paper
Dudeney Transformation of Normal Tiles2009-01-13Paper
Chromatic Numbers of Specified Isohedral Tilings2009-01-13Paper
Tile-Makers and Semi-Tile-Makers2008-03-06Paper
DEVELOPMENTS OF POLYHEDRA USING OBLIQUE COORDINATES2007-11-13Paper
Infinite Series of Generalized Gosper Space Filling Curves2007-08-28Paper
https://portal.mardi4nfdi.de/entity/Q54921442006-10-13Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
Combinatorial Geometry and Graph Theory2006-10-10Paper
Convex developments of a regular tetrahedron2006-04-28Paper
https://portal.mardi4nfdi.de/entity/Q57085542005-11-18Paper
https://portal.mardi4nfdi.de/entity/Q56926912005-09-28Paper
https://portal.mardi4nfdi.de/entity/Q54614892005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q46614752005-04-04Paper
A problem on hinged dissections with colours2004-12-13Paper
https://portal.mardi4nfdi.de/entity/Q45109502004-03-07Paper
Symmetric Hamilton cycle decompositions of the complete graph2004-02-12Paper
The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square2003-04-28Paper
Graphs \(G\) for which both \(G\) and \(\overline {G}\) are contraction critically \(k\)-connected2003-03-27Paper
https://portal.mardi4nfdi.de/entity/Q45477882002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q45477892002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q45477902002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q45477912002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q45040152002-03-18Paper
https://portal.mardi4nfdi.de/entity/Q45040162000-12-06Paper
On circles containing the maximum number of points1996-07-03Paper
https://portal.mardi4nfdi.de/entity/Q52886921993-08-15Paper
Packing paths perfectly1990-01-01Paper
Simple alternating path problem1990-01-01Paper
A note on balanced colourings for lattice points1990-01-01Paper
Packing smaller graphs into a graph1989-01-01Paper
Path chromatic numbers of graphs1989-01-01Paper
Preface1988-01-01Paper
Maximum induced forests of planar graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37811191987-01-01Paper
Eccentric graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37014411985-01-01Paper
Factors and factorizations of graphs—a survey1985-01-01Paper
On the size of graphs with complete-factors1985-01-01Paper
Almost‐regular factorization of graphs1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849461985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33374841984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33426171984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36808761984-01-01Paper
A graph and its complement with specified properties. VI: Chromatic and achromatic numbers1983-01-01Paper
Regular graphs containing a given graph1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32222371983-01-01Paper
Further results on graph equations for line graphs and \(n\)-th power graphs1981-01-01Paper
Balancing signed graphs1981-01-01Paper
A graph and its complement with specified properties. IV. Counting self-complementary blocks1981-01-01Paper
The cohesiveness of a point of a graph1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39212481981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39314291981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39314421981-01-01Paper
Covering and packing in graphs IV: Linear arboricity1981-01-01Paper
A graph and its complement with specified properties V: The self‐complement index1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39076061980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39105571980-01-01Paper
The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests1979-01-01Paper
A graph and its complement with specified properties. III: Girth and circumference1979-01-01Paper
A graph and its complement with specified properties. I: Connectivity1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38824891979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39128271979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41921101979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41893221978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41949991978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41325581977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41545751977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41863681977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41083721976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41001251975-01-01Paper

Research outcomes over time

This page was built for person: Jin Akiyama