On planarity and colorability of circulant graphs
暂无分享,去创建一个
[1] Paul Erdös,et al. Colouring the real line , 1985, J. Comb. Theory B.
[2] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.
[3] Gerard J. Chang,et al. Integral distance graphs , 1997 .
[4] Ralph Tindell,et al. Circulants and their connectivities , 1984, J. Graph Theory.
[5] Gerhard J. Woeginger,et al. Hamiltonian cycles in circulant digraphs with two stripes , 1997, Discret. Math..
[6] Rainer E. Burkard,et al. Efficiently solvable special cases of bottleneck travelling salesman problems , 1991, Discret. Appl. Math..
[7] Reinhardt Euler,et al. Coloring planar Toeplitz graphs and the stable set polytope , 2004, Discret. Math..
[8] Reinhardt Euler. Characterizing bipartite Toeplitz graphs , 2001, Theor. Comput. Sci..
[9] R. L. Brooks. On colouring the nodes of a network , 1941, Mathematical Proceedings of the Cambridge Philosophical Society.