Author： Kriesell Matthias
Publisher： Springer Publishing Company
ISSN： 0911-0119
Source： Graphs and Combinatorics, Vol.22, Iss.4, 2006-12, pp. : 481-485
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Circumference and Pathwidth of Highly Connected Graphs
JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 3, 2015-07 ,pp. :
Access to resources
Recommend
The 3-Connected Graphs with Exactly Three Non-Essential Edges
Graphs and Combinatorics, Vol. 20, Iss. 2, 2004-06 ,pp. :
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. :