|
|||||
|
|
Smaller universal targets for homomorphisms of edge-colored graphs |
|
| Authors: | Guśpiel Grzegorz |
| Institution: | 1.Theoretical Computer Science Department, Faculty of Mathematics and Computer Science, Jagiellonian University, Kraków, Poland ; |
| Abstract: | Journal of Combinatorial Optimization - For a graph G, the density of G, denoted D(G), is the maximum ratio of the number of edges to the number of vertices ranging over all subgraphs of G. For a... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |