Nowadays "colored notions of connectivity in graphs" becomes a new and active subject in graph theory. Starting from rainbow connection, monochromatic connection and proper connection appeared later. There is the edge version, and there are vertex version and total colored version of connections. Recently, directed version also appears. Many researchers are working in this field, and a lot of papers have been published in journals. So, it is time to organize a workshop to bring together people working on this subject to exchange new ideas and recent results.
The workshop will be held in Nankai University, Tianjin, China, from May 29 to May 31, 2017. Participants will come on May 28, 2017, and leave on June 1, 2017.
People from all over the world working in this field are welcomed to join the workshop. People working on rainbow dominations and rainbow matchings, as well as other rainbow structures and parameters are also welcomed.
Confirmation of attendance: March 15, 2017.
Submission of talks: April 15, 2017.
Organized by: Center for Combinatorics, Nankai University, Tianjin, China
Location: No. 94, Weijin Road, Nankai District, Tianjin 300071, China
|National Natural Science Foundation of China|
|Chinese Mathematical Society|