Add time:08/14/2019 Source:sciencedirect.com
A graph G is k-ordered if for any distinct vertices v1,v2,…,vk∈V(G), it has a cycle through v1,v2,…,vk in order. Let f(k) denote the minimum integer so that every f(k)-connected graph is k-ordered. The first non-trivial case of determining f(k) is when k=4, where the previously best known bounds are 7≤f(4)≤40. We prove that in fact f(4)=7.
We also recommend Trading Suppliers and Manufacturers of 4(7)-NITROBENZIMIDAZOLE (cas 10597-52-1). Pls Click Website Link as below: cas 10597-52-1 suppliers
About|Contact|Cas|Product Name|Molecular|Country|Encyclopedia
Message|New Cas|MSDS|Service|Advertisement|CAS DataBase|Article Data|Manufacturers | Chemical Catalog
©2008 LookChem.com,License: ICP
NO.:Zhejiang16009103
complaints:service@lookchem.com Desktop View