Author： Erdős Péter
Publisher： Springer Publishing Company
ISSN： 0167-8094
Source： Order, Vol.27, Iss.3, 2010-11, pp. : 317-325
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 Infinite–finite Duality Pairs of Directed Graphs
By Erdős Péter Tardif Claude Tardos Gábor
Order, Vol. 30, Iss. 3, 2013-11 ,pp. :
Access to resources
Recommend
Reachability is harder for directed than for undirected finite graphs
The Journal of Symbolic Logic, Vol. 55, Iss. 1, 1990-03 ,pp. :
Cheeger Inequality for Infinite Graphs
Geometriae Dedicata, Vol. 100, Iss. 1, 2003-08 ,pp. :