报告题目：Some current results on spanning trees graphs
摘要:Some conditions for a graph to have spanning trees with given properties can be weakened for biparitite graphs. We frst show such results. Next, we consider spanning trees whose stems have given properties, and show some results on these spanning trees.
报告人简介：Mikio Kano received a B.S. degree from Tokyo Institute of Technology, an M.S. degree, and Doctor's degree from Osaka University Kano was an Editor of Graphs and Combinatorics, its Managing Editor (2000-2007), and now its Editor-in-Chief. He wrote two books on graph theory, Graph Theory for Computer Science (in Japanese) and Factors and Factorizations of Graphs (LNM 2031, Springer with J. Akiyama, 2011). Kano published around 80 papers on graph theory and discrete geometry and edited about 10 books. Kano serves as a Professor at the Department of Computer and Information Sciences of Ibaraki University. He mainly studies graph theory (factors and factorizations and related topics) and discrete geometry (geometry on red and blue points (objects) and related topics).