On the cubicity of certain graphs

Information Processing Letters

Volumn 94, Issue 3, 2005, Pages 113-118

  Chandran, L S ^a   Mannino, C ^b   Oriolo, G ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

^c UNIVERSITY OF ROME TOR VERGATA   (Italy)

Author keywords

Boxicity; Clique number; Combinatorial problems; Cubicity; Hypercube; Stability number

Indexed keywords

BOUNDARY CONDITIONS; COMBINATORIAL MATHEMATICS; GEOMETRY; NUMBER THEORY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; VECTORS;

BOXICITY; CLIQUE NUMBER; COMBINATORIAL PROBLEMS; CUBICITY; HYPERCUBES; STABILITY NUMBER;

GRAPH THEORY;

EID: 15344350969     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2005.01.001     Document Type: Article

References (18)

1. N. Alon, and J.H. Spencer The Probabilistic Method second ed. 2000 John Wiley and Sons Inc. New York
2. S. Bellantoni, I.B.-A. Hartman, T. Przytycka, and S. Whitesides Grid intersection graphs and boxicity Discrete Math. 114 1993 41 49
3. Y.W. Chang, and D.B. West Interval number and boxicity of digraphs Proc. 8th Internat. Graph Theory Conf. (Kalamazoo, 1996) 1998 Wiley New York
4. Y.W. Chang, and D.B. West Rectangle number for hyper cubes and complete multipartite graphs Proc. 29th SE Conf. Comb., Graph Th. and Comp. Congr. Numer. 132 1998 19 28
5. M.B. Cozzens, Higher and multidimensional analogues of interval graphs, Ph.D. Thesis, Rutgers University, New Brunswick, NJ, 1981
6. M.B. Cozzens, and F.S. Roberts Computing the boxicity of a graph by covering its complement by cointerval graphs Discrete Appl. Math. 6 1983 217 228
7. R.B. Feinberg The circular dimension of a graph Discrete Math. 25 1979 27 31
8. R.J. Fowler, M.S. Paterson, and S.L. Tanimoto Optimal packing and covering in the plane are NP-complete Inform. Process. Lett. 12 1981 133 137
9. J.R. Griggs, and D.B. West Extremal values of the interval number of a graph SIAM J. Algebr. Discrete Methods 1980 1 7
10. H. Imai, and T. Asano Finding the connected component and a maximum clique of an intersection graph of rectangles in the plane J. Algorithms 4 1983 310 323
11. J. Kratochvil A special planar satisfiability problem and a consequence of its NP-completeness Discrete Appl. Math. 52 1994 233 252
12. F.S. Roberts Recent Progresses in Combinatorics 1969 Academic Press New York Ch. On the boxicity and cubicity of a graph, pp. 301-310
13. E.R. Scheinerman, Intersecting classes and multiple intersection parameters, Ph.D. Thesis, Princeton University, 1984
14. J.B. Shearer A note on circular dimension Discrete Math. 29 1980 103
15. C. Thomassen Interval representations of planar graphs J. Combin. Theory Ser. B 40 1986 9 20
16. W.T. Trotter, and F. Harary On double and multiple interval graphs J. Graph Theory 2 1978 137 142
17. W.T. Trotter, and J.D.B. West Poset boxicity of graphs Discrete Math. 64 1987 105 107
18. M. Yannakakis The complexity of the partial order dimension problem SIAM J. Algebr. Discrete Methods 3 1982 351 358