Cargando…
Color-induced graph colorings
A comprehensive treatment of color-induced graph colorings is presented in this book, emphasizing vertex colorings induced by edge colorings. The coloring concepts described in this book depend not only on the property required of the initial edge coloring and the kind of objects serving as colors,...
Autor principal: | Zhang, Ping |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
2015
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1007/978-3-319-20394-2 http://cds.cern.ch/record/2050779 |
Ejemplares similares
-
A kaleidoscopic view of graph colorings
por: Zhang, Ping
Publicado: (2016) -
Properly colored connectivity of graphs
por: Li, Xueliang, et al.
Publicado: (2018) -
From domination to coloring: Stephen Hedetniemi's graph theory and beyond
por: Chartrand, Gary, et al.
Publicado: (2019) -
Graph Edge Coloring: Vizing's Theorem and Goldberg's Conjecture
por: Stiebitz, Michael, et al.
Publicado: (2012) -
Sharp threshold for random graphs with a monochromatic triangle in every edge coloring
por: Friedgut, Ehud, et al.
Publicado: (2005)