The cubicity of hypercube graphs

Discrete Mathematics

Volumn 308, Issue 23, 2008, Pages 5795-5800

  Chandran, L Sunil ^a   Sivadasan, Naveen ^b  

^a INDIAN INSTITUTE OF SCIENCE   (India)

^b TATA CONSULTANCY SERVICES   (India)

Author keywords

Boxicity; Cubicity; Hypercube

Indexed keywords

BOXICITY; CARTESIAN PRODUCTS; CUBICITY; DIMENSIONAL SPACES; GRAPH G; HYPER CUBES; HYPERCUBE; INTERSECTION GRAPHS;

GRAPH THEORY;

EID: 53249092262     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.10.011     Document Type: Article

References (17)

1. Bellantoni S., Hartman I.B., Przytycka T., and Whitesides S. Grid intersection graphs and boxicity. Discrete Mathematics 114 1-3 (1993) 41-49
2. Chandran L.S., Mannino C., and Oriolo G. On the cubicity of certain graphs. Information Processing Letters 94 (2005) 113-118
3. Chandran L.S., and Sivadasan N. Boxicity and treewidth. Journal of Combinatorial Theory Series B 97 5 (2007) 733-744
4. Chang Y.W., and West D.B. Interval number and boxicity of digraphs. Proceedings of the 8th International Graph Theory Conf. (Kalamazoo 1996) (1998), Wiley
5. Y.W. Chang, D.B. West, Rectangle number for hyper cubes and complete multipartite graphs, in: 29th SE Conf. Comb., Graph Th. and Comp., Congr. Numer. 132, 1998, pp. 19-28
6. M.B. Cozzens, Higher and multidimensional analogues of interval graphs, Ph. D. thesis, Rutgers University, New Brunswick, NJ, 1981
7. Cozzens M.B., and Roberts F.S. Computing the boxicity of a graph by covering its complement by cointerval graphs. Discrete Applied Mathematics 6 (1983) 217-228
8. Feinberg R.B. The circular dimension of a graph. Discrete Mathematics 25 1 (1979) 27-31
9. Fowler R.J., Paterson M.S., and Tanimoto S.L. Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12 3 (1981) 133-137
10. Imai H., and Asano T. Finding the connected component and a maximum clique of an intersection graph of rectangles in the plane. Journal of Algorithms 4 (1983) 310-323
11. Kratochvil J. A special planar satisfiability problem and a consequence of its NP-completeness. Discrete Applied Mathematics 52 (1994) 233-252
12. Roberts F.S. Recent progresses in combinatorics. Chapter on the Boxicity and Cubicity of a Graph (1969), Academic Press, New York 301-310
13. E.R. Scheinerman, Intersecting classes and multiple intersection parameters. Ph. D. Thesis, Princeton University, 1984
14. Shearer J.B. A note on circular dimension. Discrete Mathematics 29 1 (1980) 103-103
15. Thomassen C. Interval representations of planar graphs. Journal of Combinatorial Theory, Series B 40 (1986) 9-20
16. Trotter W.T., and West D.B. Poset boxicity of graphs. Discrete Mathematics 64 1 (1987) 105-107
17. Yannakakis M. The complexity of the partial order dimension problem. SIAM Journal on Algebraic Discrete Methods 3 (1982) 351-358