1. Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes;Bae;IEEE Trans. Comput.,2003
2. Covering codes in Sierpiński graphs;Beaudou;Discret. Math. Theor. Comput. Sci.,2010
3. De Bruijn and Kautz networks: a competitor for the hypercube?;Bermond,1989
4. The book thickness of a graph;Bernhart;J. Comb. Theory, Ser. B,1979
5. Graphs & Digraphs;Chartrand,2011