Cantor-Bernstein type theorem for locally constrained graph homomorphisms
暂无分享,去创建一个
[1] Martin G. Everett,et al. Role colouring a graph , 1991 .
[2] Michael R. Fellows,et al. On the complexity and combinatorics of covering finite complexes , 1991, Australas. J Comb..
[3] Jirí Fiala,et al. Partial covers of graphs , 2002, Discuss. Math. Graph Theory.
[4] Ran Libeskind-Hadas,et al. On Multicast Algorithms for Heterogeneous Networks of Workstations , 1989, J. Parallel Distributed Comput..
[5] Jonathan L. Gross,et al. Topological Graph Theory , 1987, Handbook of Graph Theory.
[6] Jan Kratochvíl,et al. Fixed-parameter complexity of lambda-labelings , 2001, Discret. Appl. Math..
[7] Bruno Courcelle,et al. Coverings and Minors: Application to Local Computations in Graphs , 1994, Eur. J. Comb..
[8] N. Biggs. Algebraic Graph Theory , 1974 .
[9] Jan Kratochvíl,et al. On the Complexity of Graph Covering Problems , 1994, Nord. J. Comput..
[10] Dana Angluin,et al. Local and global properties in networks of processors (Extended Abstract) , 1980, STOC '80.
[11] Jan Arne Telle,et al. Generalized H-Coloring of Graphs , 2000, ISAAC.
[12] William S. Massey,et al. Algebraic Topology: An Introduction , 1977 .
[13] Frank Thomson Leighton,et al. Finite common coverings of graphs , 1982, J. Comb. Theory, Ser. B.
[14] Jan Kratochvíl,et al. Complexity of Colored Graph Covers I. Colored Directed Multigraphs , 1997, WG.