Recognition of the ℓ1-graphs with complexity O(nm), or football in a hypercube

European Journal of Combinatorics

Volumn 17, Issue 2-3, 1996, Pages 279-289

  Deza, M ^a   Shpectorov, S ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039015418     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.1996.0024     Document Type: Article

References (6)

1. F. Aurenhammer and J. Hagauer, Computing equivalence classes among the edges of a graph with application, Discr. Math., 109 (1992), 3-12.
2. V. Chvâtal, Recognizing intersection patterns, in: Combinatorics 79, Part I, M. Deza and I. G. Rosenberg (eds), Annals of Discrete Mathematics 8, North Holland, Amsterdam, 1980, pp. 249-251.
3. R. L. Graham and P. M. Winkler, On isometric embeddings of graphs, Trans. Am. Math. Soc., 288 (1985), 527-536.
4. A. V. Karzanov, Metrics and undirected cuts, Math. Programm., 32 (1985), 183-198.
5. P. G. H. Lehot, An optimal algorithm to detect a line graph and output its root graph, J. Assoc. Comput. Mach., 21 (1974), 569-575.
6. S. Shpectorov, On scale embeddings of graphs into hypercubes, Europ. J. Combin., 14 (1993), 117-130.