File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: The circumference of a graph with no K3,t-minor, II

TitleThe circumference of a graph with no K3,t-minor, II
Authors
Issue Date2012
PublisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctb
Citation
Journal of Combinatorial Theory Series B, 2012 How to Cite?
AbstractThe class of graphs with no K3;t-minors, t>=3, contains all planar graphs and plays an important role in graph minor theory. In 1992, Seymour and Thomas conjectured the existence of a function α(t)>0 and a constant β>0, such that every 3-connected n-vertex graph with no K3;t-minors, t>=3, contains a cycle of length at least α(t)nβ. The purpose of this paper is to con¯rm this conjecture with α(t)=(1/2)t(t-1) and β=log1729 2.
Persistent Identifierhttp://hdl.handle.net/10722/164176
ISSN
2014 Impact Factor: 0.983
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorChen, Gen_US
dc.contributor.authorYu, Xen_US
dc.contributor.authorZang, Wen_US
dc.date.accessioned2012-09-20T07:56:17Z-
dc.date.available2012-09-20T07:56:17Z-
dc.date.issued2012en_US
dc.identifier.citationJournal of Combinatorial Theory Series B, 2012en_US
dc.identifier.issn0095-8956-
dc.identifier.urihttp://hdl.handle.net/10722/164176-
dc.description.abstractThe class of graphs with no K3;t-minors, t>=3, contains all planar graphs and plays an important role in graph minor theory. In 1992, Seymour and Thomas conjectured the existence of a function α(t)>0 and a constant β>0, such that every 3-connected n-vertex graph with no K3;t-minors, t>=3, contains a cycle of length at least α(t)nβ. The purpose of this paper is to con¯rm this conjecture with α(t)=(1/2)t(t-1) and β=log1729 2.-
dc.languageengen_US
dc.publisherAcademic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctben_US
dc.relation.ispartofJournal of Combinatorial Theory Series Ben_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleThe circumference of a graph with no K3,t-minor, IIen_US
dc.typeArticleen_US
dc.identifier.emailZang, W: wzang@maths.hku.hken_US
dc.identifier.authorityZang, W=rp00839en_US
dc.description.naturepreprint-
dc.identifier.doi10.1016/j.jctb.2012.07.003-
dc.identifier.hkuros205943en_US
dc.identifier.isiWOS:000312362500002-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats