Sphericity, cubicity, and edge clique covers of graphs

Discrete Applied Mathematics

Volumn 154, Issue 8, 2006, Pages 1309-1313

  Michael, T S ^a   Quint, Thomas ^b  

^a UNITED STATES NAVAL ACADEMY   (United States)

^b UNIVERSITY OF NEVADA   (United States)

Author keywords

Cubicity; Edge clique cover; Intersection graph; Sphericity

Indexed keywords

BOUNDARY CONDITIONS; LINEAR EQUATIONS; MATHEMATICAL MODELS; NUMERICAL ANALYSIS; PROBLEM SOLVING; SET THEORY;

CUBICITY; EDGE CLIQUE COVER; INTERSECTION GRAPH; SPHERICITY;

GRAPH THEORY;

EID: 33645917036     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.01.004     Document Type: Article

References (20)

1. Boyer E., Lister L., and Shader B.L. Sphere-of-influence graphs using the sup-norm. Math. Comput. Modelling 32 (2000) 1071-1082
2. Breu H., and Kirkpatrick D.G. Unit disk graph recognition is NP-hard. Comput. Geom. 9 (1998) 3-24
3. Clark B.N., Colbourn C.J., and Johnson D.S. Unit disk graphs. Discrete Math. 86 (1990) 165-177
4. Erdos P., Goodman A.W., and Pósa L. The representation of a graph by set intersections. Canad. J. Math. 18 (1966) 106-112
5. Fishburn P.C. On the sphericity and cubicity of graphs. J. Combin. Theory Ser. B 35 (1983) 309-318
6. Frankl P., and Maehara H. Embedding the n-cube in lower dimensions. European J. Combin. 7 (1986) 221-225
7. Frankl P., and Maehara H. The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Combin. Theory Ser. B 44 (1988) 355-362
8. Hliněný P., and Kratochvíl J. Representing graphs by disk and balls (a survey of recognition-complexity results). Discrete Applied Math. 229 (2001) 101-124
9. Maehara H. Space graphs and sphericity. Discrete Applied Math. 7 (1984) 55-64
10. Maehara H. On the sphericity for the join of many graphs. Discrete Math. 49 (1984) 311-313
11. Maehara H. Sphericity exceeds cubicity for almost all complete bipartite graphs. J. Combin. Theory Ser. B 40 (1986) 231-235
12. Maehara H. On the sphericity of the graphs of semi-regular polyhedra. Discrete Math. 58 (1986) 311-315
13. Maehara H. Independent balls and unit neighborhood graphs. Ryukyu Math. J. 1 (1988) 38-55
14. Maehara H., Reiterman J., Rödl V., and Šiňajová E. Embedding of trees in Euclidean spaces. Graphs Combin. 4 (1988) 43-47
15. Monson S.D., Pullman N.J., and Rees R. A survey of clique and biclique coverings and factorizations of (0,1)-matrices. Bull. Inst. Combin. Appl. 14 (1995) 17-86
16. Reiterman J., Rödl V., and Šiňajová E. Geometrical embeddings of graphs. Discrete Math. 74 (1989) 291-319
17. Reiterman J., Rödl V., and Šiňajová E. Embeddings of graphs in Euclidean spaces. Discrete Comput. Geom. 4 (1989) 349-364
18. Roberts F.S. Indifference graphs. In: Harary F. (Ed). Proof Techniques in Graph Theory (1969), Academic Press, New York 139-146
19. F.S. Roberts, On the boxicity and cubicity of a graph, Recent Progress in Combinatorics, Proc. Third Waterloo Conf. on Combinatorics, 1968, Academic Press, New York, 1969, pp. 301-310.
20. Roberts F.S. Applications of edge coverings by cliques. Discrete Appl. Math. 10 (1985) 93-109