Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)
From MaRDI portal
Publication:2373936
DOI10.1007/s00373-007-0720-5zbMath1137.01320OpenAlexW2081584339WikidataQ57309818 ScholiaQ57309818MaRDI QIDQ2373936
Jorge Urrutia, Mari-jo P. Ruiz, Mikio Kano
Publication date: 19 July 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0720-5
Cites Work
- Problem-solving through problems
- On factors with given components
- Packing paths perfectly
- Simple alternating path problem
- A note on balanced colourings for lattice points
- Eccentric graphs
- Maximum induced forests of planar graphs
- The linear arboricity of graphs
- A graph and its complement with specified properties. III: Girth and circumference
- ``Integer-making theorems
- A graph and its complement with specified properties. I: Connectivity
- Some geometric applications of Dilworth's theorem
- Graphs \(G\) for which both \(G\) and \(\overline {G}\) are contraction critically \(k\)-connected
- The optimality of a certain purely recursive dissection for a sequentially \(n\)-divisible square
- A problem on hinged dissections with colours
- Note on geometric graphs
- Convex developments of a regular tetrahedron
- Large induced forests in triangle-free planar graphs
- A graph and its complement with specified properties. IV. Counting self-complementary blocks
- Research Problems in Discrete Geometry
- Bounds for the vertex linear arboricity
- Universal Measuring Boxes with Triangular Bases
- The linear arboricity of some regular graphs
- Factors and factorizations of graphs—a survey
- A graph and its complement with specified properties V: The self‐complement index
- Covering and packing in graphs IV: Linear arboricity
- Path chromatic numbers of graphs
- Almost‐regular factorization of graphs
- Tile-Makers and Semi-Tile-Makers
- Combinatorial Geometry and Graph Theory
- Decomposition of Finite Graphs Into Forests
- The Factors of Graphs
- The 1-Factors of Oriented Graphs
- The acyclic elements of a Peano space
- Discrete and Computational Geometry
- Discrete and Computational Geometry
- Discrete and Computational Geometry
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Jin Akiyama: a friend and his mathematics (on the occasion of his 60th birthday)