File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.jctb.2012.07.003
- Scopus: eid_2-s2.0-84868707018
- WOS: WOS:000312362500002
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: The circumference of a graph with no K3,t-minor, II
| Title | The circumference of a graph with no K3,t-minor, II |
|---|---|
| Authors | |
| Keywords | Circumference Connectivity Graph minor Path and cycle |
| Issue Date | 2012 |
| Publisher | Academic 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? |
| Abstract | The 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 Identifier | http://hdl.handle.net/10722/164176 |
| ISSN | 2021 Impact Factor: 1.491 2020 SCImago Journal Rankings: 1.686 |
| ISI Accession Number ID |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Chen, G | en_US |
| dc.contributor.author | Yu, X | en_US |
| dc.contributor.author | Zang, W | en_US |
| dc.date.accessioned | 2012-09-20T07:56:17Z | - |
| dc.date.available | 2012-09-20T07:56:17Z | - |
| dc.date.issued | 2012 | en_US |
| dc.identifier.citation | Journal of Combinatorial Theory Series B, 2012 | en_US |
| dc.identifier.issn | 0095-8956 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/164176 | - |
| dc.description.abstract | The 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.language | eng | en_US |
| dc.publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jctb | en_US |
| dc.relation.ispartof | Journal of Combinatorial Theory Series B | en_US |
| dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
| dc.subject | Circumference | - |
| dc.subject | Connectivity | - |
| dc.subject | Graph minor | - |
| dc.subject | Path and cycle | - |
| dc.title | The circumference of a graph with no K3,t-minor, II | en_US |
| dc.type | Article | en_US |
| dc.identifier.email | Zang, W: wzang@maths.hku.hk | en_US |
| dc.identifier.authority | Zang, W=rp00839 | en_US |
| dc.description.nature | preprint | - |
| dc.identifier.doi | 10.1016/j.jctb.2012.07.003 | - |
| dc.identifier.scopus | eid_2-s2.0-84868707018 | - |
| dc.identifier.hkuros | 205943 | en_US |
| dc.identifier.isi | WOS:000312362500002 | - |
| dc.publisher.place | United States | - |
| dc.identifier.issnl | 0095-8956 | - |