Publisher： Cambridge University Press
E-ISSN： 1943-5886|62|2|609-623
ISSN： 0022-4812
Source： The Journal of Symbolic Logic, Vol.62, Iss.2, 1997-06, pp. : 609-623
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
On sparse graphs with given colorings and homomorphisms
Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. :
Access to resources
Recommend
Spreading of Messages in Random Graphs
Theory of Computing Systems, Vol. 48, Iss. 2, 2011-02 ,pp. :
Sparse networks tolerating random faults
By Yamada T. Nomura K. Ueno S.
Discrete Applied Mathematics, Vol. 137, Iss. 2, 2004-03 ,pp. :
Homomorphisms from sparse graphs with large girth
By Borodin O.V. Kim S.-J. Kostochka A.V. West D.B.
Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. :
On the structure of random unlabelled acyclic graphs
By McColm G.L.
Discrete Mathematics, Vol. 277, Iss. 1, 2004-02 ,pp. :