Recognition of the l 1 -Graphs with Complexity O(nm), or Football in a Hypercube

ISSN： 0195-6698

Source： European Journal of Combinatorics, Vol.17, Iss.2, 1996-02, pp. : 279-289

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Note on l 1 -rigid Planar Graphs

By deza M. Tuma J.

European Journal of Combinatorics, Vol. 17, Iss. 2, 1996-02 ,pp. : 157-160

Academic Press

Access to resources Recommend Favorite

On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs

By Imrich W. Klavzar S.

European Journal of Combinatorics, Vol. 17, Iss. 2, 1996-02 ,pp. : 209-221

Academic Press

Access to resources Recommend Favorite

Recognition problems and communication complexity

By Wiener G.

Discrete Applied Mathematics, Vol. 137, Iss. 1, 2004-02 ,pp. : 109-123

Elsevier

Access to resources Recommend Favorite

On Two-Graphs of Ovoids in O2n + 1(q)

By Gunawardena A.

European Journal of Combinatorics, Vol. 18, Iss. 8, 1997-11 ,pp. : 857-858

Academic Press

Access to resources Recommend Favorite

The local recognition of reflection graphs of spherical Coxeter groups

By Gramlich Ralf Hall Jonathan Straub Armin

Journal of Algebraic Combinatorics, Vol. 32, Iss. 1, 2010-08 ,pp. : 1-14

Springer Publishing Company

Access to resources Recommend Favorite