{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:36:35Z","timestamp":1737178595326,"version":"3.33.0"},"reference-count":95,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1007\/s00373-007-0720-5","type":"journal-article","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T11:26:17Z","timestamp":1183375577000},"page":"1-39","source":"Crossref","is-referenced-by-count":1,"title":["Jin Akiyama: A Friend and His Mathematics"],"prefix":"10.1007","volume":"23","author":[{"given":"M.","family":"Kano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mari-Jo P.","family":"Ruiz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jorge","family":"Urrutia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"720_CR1","unstructured":"Akiyama, J.: Factorization and linear arboricity of graphs, Doctor of Science Thesis. Tokyo University of Science (1982)"},{"key":"720_CR2","unstructured":"Akiyama, J.: S-wellposedness of partial differential equations with constant coefficients. Master\u2019s Thesis. Sophia University (1972)"},{"key":"720_CR3","unstructured":"Akiyama, J.: The many facets of the middle graphs. In: Proceedings of Workshop on Combinatorial Structure and Graph Theory, vol. 259, pp. 72\u2013118. RIMS, Kyoto University (1976)"},{"key":"720_CR4","doi-asserted-by":"crossref","unstructured":"Akiyama, J.: A status report on the linear arboricity. Graph Theory and Algorithms. Lecture Notes in Computer Science vol. 108, pp. 38\u201344. Springer, Berlin (1981)","DOI":"10.1007\/3-540-10704-5_4"},{"key":"720_CR5","unstructured":"Akiyama, J.: Reversible Solids: Bridging Mathematics and Art, Tokyo (2000)"},{"key":"720_CR6","unstructured":"Akiyama, J.: Mathematical Art in ICME 9, Makuhari (2000)"},{"key":"720_CR7","unstructured":"Akiyama, J., et al.: Why Mathematics? UNESCO, Paris (2004)"},{"key":"720_CR8","unstructured":"Akiyama, J.: You Can Be an Artist Like Escher. Ateneo de Manila University Quezon City (2006)"},{"key":"720_CR9","unstructured":"Akiyama, J.: Mathematical Circus in Madrid. http:\/\/www.eurocg.org\/www.us.es\/ewcg04\/cosmoakiyama.pdf"},{"key":"720_CR10","unstructured":"Akiyama, J.: Popularizing math through mass media. In: Proceedings of the 10th MATH TED, Ateneo de Manila University Quezon City (2006)"},{"key":"720_CR11","unstructured":"Akiyama, J.: Mathematics for mass media. In: Proceedings of ICME 10, Copenhagen, 2006"},{"key":"720_CR12","unstructured":"Akiyama, J.: Tile makers and semi-tile makers. Am. Math. Mon. 114, 602\u2013609 (2007)"},{"key":"720_CR13","unstructured":"Akiyama, J., Alon, N.: Disjoint simplices and geometric hypergraphs. Combinatorial Mathematics. In: Proceedings of the Third International Conference. Ann. N.Y. Acad. Sci. 555, 1\u20133 (1989)"},{"key":"720_CR14","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Ando, K., Avis, D.: Eccentric graphs. Discrete Math. 56(1), 1\u20136 (1985)","DOI":"10.1016\/0012-365X(85)90188-8"},{"key":"720_CR15","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Ando, K., Egawa, Y.: Graphs G for which both G and $$\\overline{G}$$ are contraction critically k-connected. Graphs Comb. 18(4), 693\u2013708 (2002)","DOI":"10.1007\/s003730200054"},{"key":"720_CR16","unstructured":"Akiyama, J., Ando, K., Harary, F.: A graph and its complement with specified properties VIII: Interval graphs. Math. Jpn. 29(4), 659\u2013670 (1984)"},{"key":"720_CR17","unstructured":"Akiyama, J., Avis, D., Era, H.: On a {1,2}-factor of a graph. TRU Math. 16(2), 97\u2013102 (1980)"},{"key":"720_CR18","unstructured":"Akiyama, J., Chv\u00e1tal, V.: A short proof of the linear arboricity for cubic graphs. Bull. Liber. Arts and Sci., vol. 2, pp. 1\u20133. Nippon Medical School (1981)"},{"key":"720_CR19","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Chv\u00e1tal, V.: Packing paths perfectly. Discrete Math. 85(3), 247\u2013255 (1990)","DOI":"10.1016\/0012-365X(90)90382-R"},{"key":"720_CR20","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Era, H., Gervacio, S., Watanabe, M.: Path chromatic numbers of graphs. J. Graph Theory 13(5), 569\u2013575 (1989)","DOI":"10.1002\/jgt.3190130506"},{"key":"720_CR21","unstructured":"Akiyama, J., Exoo, G.: Suggested open problems by conference participants. In: The theory and applications of graphs, p. 609. Wiley-Interscience, New York (1981)"},{"key":"720_CR22","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Exoo, G., Harary, F.: A graph and its complement with specified properties V: The Self-Complement Index. Mathematika 27(1), 64\u201368 (1980)","DOI":"10.1112\/S0025579300009943"},{"key":"720_CR23","unstructured":"Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs III: Cyclic and acyclic invariants. Math. Slovaca 30(4), 405\u2013417 (1980)"},{"key":"720_CR24","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Exoo, G., Harary, F.: Covering and packing in graphs IV: Linear arboricity. Networks 11(1), 69\u201372 (1981)","DOI":"10.1002\/net.3230110108"},{"key":"720_CR25","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Fukuda, H., Nakamura, G.: Universal measuring devices with rectangular base. Discrete and Computational Geometry, Lecture Notes in Computer Science vol. 2866, pp. 1\u20138. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-44400-8_1"},{"key":"720_CR26","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Fukuda, H., Nakamura, G., Sakai, T., Urrutia, J., Zamora-Cura, C.: Universal measuring devices without gradations. Discrete and Computational Geometry, Lecture Notes in Computer Science vol. 2098, pp. 31\u201340. Springer, Berlin (2001)","DOI":"10.1007\/3-540-47738-1_2"},{"key":"720_CR27","unstructured":"Akiyama, J., Fukuda, H., Nara, C., Sakai, T., Urrutia, J.: Universal measuring boxes with triangle base. Am. Math. Mon. (in press)"},{"key":"720_CR28","unstructured":"Akiyama, J., Harary, F.: A graph and its complement with specified properties I: Connectivity. Int. J. Math. Math. Sci. 2(2), 223\u2013228 (1979)"},{"key":"720_CR29","unstructured":"Akiyama, J., Harary, F.: A graph and its complement with specified properties III: Girth and circumference. Int. J. Math. Math. Sci. 2(4), 685\u2013692 (1979)"},{"key":"720_CR30","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Harary, F.: A graph and its complement with specified properties. IV: Counting self-complementary blocks. J. Graph Theory 5(1), 103\u2013107 (1981)","DOI":"10.1002\/jgt.3190050108"},{"key":"720_CR31","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Hirata, K., Kobayashi, M., Nakamura, G.: Convex developments of a regular tetrahedron. Comput. Geometry Theory Appl. 34(1), 2\u201310 (2006)","DOI":"10.1016\/j.comgeo.2005.07.003"},{"key":"720_CR32","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Hurtado, F., Merino, C., Urrutia, J.: A problem on hinged dissections with colours. Graphs Comb. 20(2), 145\u2013159 (2004)","DOI":"10.1007\/s00373-003-0546-8"},{"key":"720_CR33","unstructured":"Akiyama, J., Kano, M.: Path factors of a graph. In: Harary, F., Maybee, J.S. (eds.) Graphs and Applications, pp. 1\u201321. Wiley, New York (1982)"},{"key":"720_CR34","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Kano, M.: Factors and factorizations of graphs\u2014a survey. J. Graph Theory 9(1), 1\u201342 (1985)","DOI":"10.1002\/jgt.3190090103"},{"key":"720_CR35","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Kano, M.: Almost-regular factorization of graphs. J. Graph Theory 9(1), 123\u2013128 (1985)","DOI":"10.1002\/jgt.3190090110"},{"key":"720_CR36","unstructured":"Akiyama, J., Kano, M.: 1-factors of triangle graphs. In: Number Theory Comb. Tokyo 1984, pp. 21\u201335. World Scientific, Singapore (1985)"},{"key":"720_CR37","unstructured":"Akiyama, J., Kano, M.: Factors and factorizations of graphs. Electronic Book (2007)"},{"key":"720_CR38","unstructured":"Akiyama, J., Kano, M., Ruiz, M-J.: Tiling finite figures consisting of regular polygons. In: Proceedings of the 5th International Conference on Graph Theory and its Applications, pp. 1\u201313. Wiley-Interscience, New York (1985)"},{"key":"720_CR39","unstructured":"Akiyama, J., Nakamura, G.: An efficient dissection for a sequentially n-divisible square. In: Proceedings of Discrete and Computational Geometry Workshop \u201997, pp. 80\u201389 (1997)"},{"key":"720_CR40","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Nakamura, G.: A lesson on double packable solids. Teaching Mathematics and Its Applications, vol. 18(1), pp. 30\u201333. Oxford University Press, New York (1999)","DOI":"10.1093\/teamat\/18.1.30"},{"key":"720_CR41","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Nakamura, G.: Dudeney dissections of polygons. Discrete and Computational Geometry, Lecture Notes in Computer Science, vol. 1763, pp. 14\u201329. Springer, (2000)","DOI":"10.1007\/b75044"},{"key":"720_CR42","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Nakamura, G.: Dudeney dissections of polygons and polyhedrons: a survey. Discrete and Computational Geometry, Lecture Notes in Computer Science, vol. 2098, pp. 1\u201330. Springer, Berlin (2001)","DOI":"10.1007\/3-540-47738-1_1"},{"key":"720_CR43","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Nakamura, G.: Congruent Dudeney dissections of triangles and convex quadrilaterals\u2014all hinge points interior to the sides of the polygons. Discrete and Computational Geometry, The Goodman\u2013Pollack Festschrift. In: Aronov, B., Basu, S., Pach, J., Sharir, M., (eds.) Algorithms and Combinatorics, vol. 25, pp. 43\u201363. Springer, New York (2003)","DOI":"10.1007\/978-3-642-55566-4_3"},{"key":"720_CR44","unstructured":"Akiyama, J., Nakamura, G.: Determination of all convex polygons which are chameleons\u2014Congruent Dudeney dissections of polygons. IEICE TRANS. Fundamentals E86-A(5), 978\u2013986 (2003)"},{"key":"720_CR45","unstructured":"Akiyama, J., Nakamura, G.: Foldings of regular polygons to convex polyhedra II: Regular pentagons. J. Indones. Math. Soc. (MIHMI) 9(2), 89\u201399 (2003)"},{"key":"720_CR46","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Nakamura, G.: Congruent Dudeney dissections of polygons\u2014all the hinge points on vertices of the polygon. Discrete and Computational Geometry, Lecture Notes in Computer Science, vol. 2866, pp. 14\u201321. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-44400-8_3"},{"key":"720_CR47","unstructured":"Akiyama, J., Nakamura, G.: Foldings of regular polygons to convex polyhedra III: Regular hexagons and regular n-gons, n \u2265 7. Thai J. Math. 2(1), 1\u201314 (2004)"},{"key":"720_CR48","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Nakamura, G.: Foldings of regular polygons to convex polyhedra I: Equilateral triangles. Combinatorial Geometry and Graph Theory, Lecture Notes in Computer Science, vol. 3330, pp. 34\u201343. Springer, New York (2005)","DOI":"10.1007\/978-3-540-30540-8_4"},{"key":"720_CR49","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Nakamura, G., Nozaki, A., Ozawa, K.: A note on the purely recursive dissection for a sequentially n-divisible square. Discrete and Computational Geometry, Lecture Notes in Computer Science, vol. 2098, pp. 41\u201352. Springer New York (2001)","DOI":"10.1007\/3-540-47738-1_3"},{"key":"720_CR50","unstructured":"Akiyama, J., Nakamura, G., Nozaki, A., Ozawa, K., Sakai, T.: The optimality of a certain purely recursive dissection for a sequentially n-divisible square. Comput. Geom. Theory Appl. 24(1), 27\u201339 (2003)"},{"key":"720_CR51","unstructured":"Akiyama, J., Nara, C.: Infinite sequences for developments of tetrahedra. The Bulletin of the Higher Education Research Institute, vol. 13, pp. 11\u201324. Tokai University (2005)"},{"key":"720_CR52","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Nara, C., Sakai, T.: What does it take to get students excited about mathematics? The Bulletin of the Higher Education Research Institute, vol. 10, pp. 15\u201327. Tokai University (2003)","DOI":"10.1002\/he.116"},{"key":"720_CR53","unstructured":"Akiyama, J., Sakai, T.: Theorems and problems in basic geometry arisen from everyday life. The Bulletin of the Higher Education Research Institute, vol. 6, pp. 113\u2013134. Tokai University (1998)"},{"key":"720_CR54","unstructured":"Akiyama, J., Sakai, T., Hirano, Y.: Nonstandard ways of teaching standard mathematics. In: Proceedings of the 8th Southeast Asian Conference on Mathematical Education, pp. 7\u201333. Ateneo de Manila University Press, Quezon city (1999)"},{"key":"720_CR55","unstructured":"Akiyama, J., Sakai, T., Torigoe, N., Watanabe, Y.: Nonstandard ways of teaching standard mathematics II\u2014Miscellaneous properties of circles. The Bulletin of the Higher Education Research Institute, Tokai University, vol. 8, pp. 1\u201314 (2000)"},{"key":"720_CR56","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Sakai, T., Urrutia, J.: Sequentially divisible dissections of simple polygons. Discrete and Computational Geometry, Lecture Notes in Computer Science, vol. 2098, pp. 53\u201366. Springer, New York (2001)","DOI":"10.1007\/3-540-47738-1_4"},{"key":"720_CR57","unstructured":"Akiyama, J., Torigoe, N.: Teaching probability distributions with a cradle pinball device. In: Proceedings of the 8th Southeast Asian Conference on Mathematical Education, pp. 69\u201375. Ateneo de Manila University Press, Quezon city (1999)"},{"key":"720_CR58","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Urrutia, J.: A note on balanced colourings for lattice points. Discrete Math. 83(1), 123\u2013126 (1990)","DOI":"10.1016\/0012-365X(90)90227-9"},{"key":"720_CR59","doi-asserted-by":"crossref","unstructured":"Akiyama, J., Urrutia, J.: Simple alternating path problem. Discrete Math. 84(1), 101\u2013103 (1990)","DOI":"10.1016\/0012-365X(90)90276-N"},{"key":"720_CR60","unstructured":"Akiyama, J., Watanabe, M.: Maximum induced forests of planar graphs. Graphs Comb. Res. Prob. 3(2), 201\u2013202 (1987)"},{"key":"720_CR61","unstructured":"Albertson, M. O., Berman, D.: A conjecture on planar graphs. In: Bondy, J. A., Murty, U. S. R. (eds.) Graph Theory and Related Topics, vol. 357. Academic Press, New York (1979)"},{"key":"720_CR62","unstructured":"Albertson, M. O., Haas, R.: DIMACS meeting in the summer of 1998"},{"key":"720_CR63","doi-asserted-by":"crossref","unstructured":"Aleksandrov, A. D.: Konvexe Polyeder. Akademie, New York (1958)","DOI":"10.1515\/9783112727690"},{"key":"720_CR64","doi-asserted-by":"crossref","unstructured":"Alexander, R., Dyson, H., O\u2019Rourke, J.: The foldings of a square to convex polyhedra. Discrete and Computational Geometry, Lecture Notes in Computer Science vol. 2866, pp. 38\u201350 (2003)","DOI":"10.1007\/978-3-540-44400-8_5"},{"key":"720_CR65","unstructured":"Alon, N.: The linear arboricity of graphs. Israel J. Math. 62, 311\u2013325 (1988)"},{"key":"720_CR66","doi-asserted-by":"crossref","unstructured":"Amahashi, A., Kano, M.: On factors with given components. Discrete Math. 42(1), 1\u20136 (1982)","DOI":"10.1016\/0012-365X(82)90048-6"},{"key":"720_CR67","unstructured":"Beck, J., Fiala, T.: Integer-making theorems. Discrete Appl. Math. 3(1), 1\u20138 (1981)"},{"key":"720_CR68","doi-asserted-by":"crossref","unstructured":"Biedl, T. C., \u010cenek, E., Chan, T. M., Demaine, E. D., Demaine, M. L., Fleischer, R., Wang, M.- W.: Balanced k-colorings. Discrete Math. 254(1\u20133), 19\u201332 (2002)","DOI":"10.1016\/S0012-365X(01)00431-9"},{"key":"720_CR69","unstructured":"Bolyai, F.: Tentamen juventutem, Typis Collegii Reformatorum per Josephum et Simeonem Kali (in Hungarian), 1832"},{"key":"720_CR70","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, Berlin (2005)"},{"key":"720_CR71","unstructured":"Coxeter, H. S. M.: Introduction to Geometry, Wiley, New York (1965)"},{"key":"720_CR72","unstructured":"Dudeney, H. E.: The Canterbury Puzzles and Other Curious Problems. W. Heinemann, 1907."},{"key":"720_CR73","unstructured":"Egawa, Y.: Era\u2019s conjecture on [k,k\u00a0+\u00a01]-factorizations of regular graphs. Ars Combin. 21, 217\u2013220 (1986)"},{"key":"720_CR74","doi-asserted-by":"crossref","unstructured":"Enomoto, H., P\u00e9roche, B.: The linear arboricity of some regular graphs. J. Graph Theory 8(2), 309\u2013324 (1984)","DOI":"10.1002\/jgt.3190080211"},{"key":"720_CR75","unstructured":"Era, H.: Semiregular factorizations of regular graphs. Graphs and applications, Boulder, Colo., 1982, pp. 101\u2013116. Wiley Interscience, Wiley, New York (1985)"},{"key":"720_CR76","doi-asserted-by":"crossref","unstructured":"Frederickson, G. N.: Dissections: Plane and Fancy, Cambridge University Press, London (1997)","DOI":"10.1017\/CBO9780511574917"},{"key":"720_CR77","unstructured":"Frederickson, G. N.: Hinged Dissections: Swinging and Twisting, Cambridge University Press, London (2002)"},{"key":"720_CR78","doi-asserted-by":"crossref","unstructured":"Gerwien, P.: Zerschneidung jeder beliebigen Anzahl von Gleichen geradlinigen Figuren in dieselben St\u00fccke. J. f\u00fcr die reine Angew. Math. (Crelle\u2019s Journal) 10, 228\u2013234 and Taf. III (1833)","DOI":"10.1515\/crll.1833.10.228"},{"key":"720_CR79","doi-asserted-by":"crossref","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. In: Berge, C., Chv\u00e1tal, V. (eds.) Topics on Perfect Graphs. Ann. Discrete Math. 21, 325\u2013356. North-Holland, Amsterdam (1984)","DOI":"10.1016\/S0304-0208(08)72943-8"},{"key":"720_CR80","doi-asserted-by":"crossref","unstructured":"Klarner, D. A.: The Mathematical Gardner. Wadsworth International, Belmont (1981)","DOI":"10.1007\/978-1-4684-6686-7"},{"key":"720_CR81","unstructured":"Larson, H.: Geometric Dissections. Van Nostrand, New York (1964)"},{"key":"720_CR82","doi-asserted-by":"crossref","unstructured":"Larson, L. C.: Problem-solving through problems, vol. 51, pp. 200\u2013201. Springer, New York (1983)","DOI":"10.1007\/978-1-4612-5498-0"},{"key":"720_CR83","doi-asserted-by":"crossref","unstructured":"Matsumoto, M.: Bounds for the vertex linear arboricity. J. Graph Theory 14, 117\u2013126 (1990)","DOI":"10.1002\/jgt.3190140113"},{"key":"720_CR84","doi-asserted-by":"crossref","unstructured":"Nash-Williams, C. St. J. A.: Decomposition of finite graphs into forests. J. London Math. Soc. 39, 12 (1964)","DOI":"10.1112\/jlms\/s1-39.1.12"},{"key":"720_CR85","unstructured":"Oka, H.: Be Brilliant as Long as You Live, (in Japanese) Fujin Seikatsusha, 1999"},{"key":"720_CR86","unstructured":"Pach, J., T\u00f6r\u00f6csik, J.: Some geometric applications of Dilworth\u2019s theorem, Discrete Comput. Geom. 12, 1\u20137 (1994)"},{"key":"720_CR87","unstructured":"Ruiz, M-J.: Mathematical art in Japan. http:\/\/www.eurocg.org\/www.us.es\/ewcg04\/ mathlartinjapan.PDF"},{"key":"720_CR88","doi-asserted-by":"crossref","unstructured":"Salavatipour, M.R.: Large induced forests in triangle-free planar graphs. Graphs Comb. 22(1), 113\u2013126 (2006)","DOI":"10.1007\/s00373-006-0642-7"},{"key":"720_CR89","unstructured":"Tomasta, P.: Note on linear arboricity. Math. Slovaca 32, 239\u2013242 (1982)"},{"key":"720_CR90","unstructured":"T\u00f3th, G.: Note on geometric graphs, J. Combin. Theory A 89, 126\u2013132 (2000)"},{"key":"720_CR91","unstructured":"Tutte, W. T.: The factors of graphs. Can. J. Math. 4, 314\u2013328 (1952)"},{"key":"720_CR92","doi-asserted-by":"crossref","unstructured":"Tutte, W. T.: The 1-factors of oriented graphs. Proc. Am. Math. Soc. 4, 922\u2013931 (1953)","DOI":"10.1090\/S0002-9939-1953-0063009-7"},{"key":"720_CR93","unstructured":"Wallace, W. (ed.): Elements of Geometry (8th ed.), Bell & Bradfute, first six books of Euclid, with a supplement by John Playfair, 1831"},{"key":"720_CR94","doi-asserted-by":"crossref","unstructured":"Whitesides, S.: A method for solving certain graph recognition and optimization problems, with applications to perfect graphs. In: Berge, C., Chv\u00e1tal, V. (eds.) Topics on Perfect Graphs. Ann. Discrete Math. 21, 281\u2013297 North-Holland, Amsterdam (1984)","DOI":"10.1016\/S0304-0208(08)72941-4"},{"key":"720_CR95","doi-asserted-by":"crossref","unstructured":"Wu, J-L.: On the linear arboricity of planar graphs. J. Graph Theory 31(2), 129\u2013134 (1999)","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<129::AID-JGT5>3.0.CO;2-A"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0720-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-007-0720-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-007-0720-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T02:27:56Z","timestamp":1737167276000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-007-0720-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":95,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["720"],"URL":"https:\/\/doi.org\/10.1007\/s00373-007-0720-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}