Towards a characterization of order-invariant queries over tame graphs

Publisher： Cambridge University Press

E-ISSN： 1943-5886|74|1|168-186

ISSN： 0022-4812

Source： The Journal of Symbolic Logic, Vol.74, Iss.1, 2009-03, pp. : 168-186

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

Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order

By Fan Yi-Zheng  

Linear and Multilinear Algebra, Vol. 56, Iss. 4, 2008-07 ,pp. : 381-397

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the order of countable graphs

By Nesetril J.   Shelah S.  

European Journal of Combinatorics, Vol. 24, Iss. 6, 2003-08 ,pp. : 649-663

Elsevier

Access to resources Recommend Favorite

Invariant graphs of functions for the mean-type mappings

By  

ESAIM: Proceedings, Vol. 36, Iss. issue, 2012-08 ,pp. : 209-216

Edp Sciences

Access to resources Recommend Favorite

On a Characterization of Bilinear Forms Graphs

By Metsch K.  

European Journal of Combinatorics, Vol. 20, Iss. 4, 1999-05 ,pp. : 293-306

Elsevier

Access to resources Recommend Favorite

Characterization and enumeration of hypotraversable graphs

By  

Bulletin of the Australian Mathematical Society, Vol. 20, Iss. 3, 1979-06 ,pp. : 437-445

Cambridge University Press

Access to resources Recommend Favorite