Author： Nebesky Ladislav
Publisher： Springer Publishing Company
ISSN： 0011-4642
Source： Czechoslovak Mathematical Journal, Vol.55, Iss.2, 2005-06, pp. : 283-293
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
Signpost systems and spanning trees of graphs
Czechoslovak Mathematical Journal, Vol. 56, Iss. 3, 2006-09 ,pp. :
Access to resources
Recommend
COMPLEXES OF NOT i-CONNECTED GRAPHS
By Babson E. Bjorner A. Linusson S. Shareshian J. Welker V.
Topology, Vol. 38, Iss. 2, 1999-03 ,pp. :
Connected Resolvability of Graphs
By Saenpholphat Varaporn Zhang Ping
Czechoslovak Mathematical Journal, Vol. 53, Iss. 4, 2003-12 ,pp. :
Super-connected and hyper-connected jump graphs
International Journal of Computer Mathematics, Vol. 85, Iss. 12, 2008-12 ,pp. :