5-cycles and the Petersen graph
We show that if G is a connected bridgeless cubic graph whose every 2-factor is comprised of cycles of length five then G is the Petersen graph.
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | DeVos, Matt Mkrtchyan, Vahan V Petrosyan, Samvel S |
| description | We show that if G is a connected bridgeless cubic graph whose every 2-factor
is comprised of cycles of length five then G is the Petersen graph. |
| doi_str_mv | 10.48550/arxiv.0801.3714 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_0801_3714</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>0801_3714</sourcerecordid><originalsourceid>FETCH-LOGICAL-a654-a981bc3f4a110608e8058d346d01526b4c13dfb2f8b8ddd2aa39bfe3338730ce3</originalsourceid><addsrcrecordid>eNotzrsKAjEQQNE0FqL2Vro_sOtkJ1nHUsQXCFrYL5NkooKKZEX078VHdbvLUaqvoTBkLYw4PU-PAgh0gWNt2mpoc__yZ2kyvobsfpRsJ3dJjVyzQ-Lbsatakc-N9P7tqP1ivp-t8s12uZ5NNzlX1uQ8Ie08RsNaQwUkBJYCmiqAtmXljNcYoisjOQohlMw4cVEQkcYIXrCjBr_tF1jf0unC6VV_oPUHim-LpTaD</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>5-cycles and the Petersen graph</title><source>arXiv.org</source><creator>DeVos, Matt ; Mkrtchyan, Vahan V ; Petrosyan, Samvel S</creator><creatorcontrib>DeVos, Matt ; Mkrtchyan, Vahan V ; Petrosyan, Samvel S</creatorcontrib><description>We show that if G is a connected bridgeless cubic graph whose every 2-factor
is comprised of cycles of length five then G is the Petersen graph.</description><identifier>DOI: 10.48550/arxiv.0801.3714</identifier><language>eng</language><subject>Computer Science - Discrete Mathematics</subject><creationdate>2008-01</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/0801.3714$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.0801.3714$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>DeVos, Matt</creatorcontrib><creatorcontrib>Mkrtchyan, Vahan V</creatorcontrib><creatorcontrib>Petrosyan, Samvel S</creatorcontrib><title>5-cycles and the Petersen graph</title><description>We show that if G is a connected bridgeless cubic graph whose every 2-factor
is comprised of cycles of length five then G is the Petersen graph.</description><subject>Computer Science - Discrete Mathematics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKAjEQQNE0FqL2Vro_sOtkJ1nHUsQXCFrYL5NkooKKZEX078VHdbvLUaqvoTBkLYw4PU-PAgh0gWNt2mpoc__yZ2kyvobsfpRsJ3dJjVyzQ-Lbsatakc-N9P7tqP1ivp-t8s12uZ5NNzlX1uQ8Ie08RsNaQwUkBJYCmiqAtmXljNcYoisjOQohlMw4cVEQkcYIXrCjBr_tF1jf0unC6VV_oPUHim-LpTaD</recordid><startdate>20080124</startdate><enddate>20080124</enddate><creator>DeVos, Matt</creator><creator>Mkrtchyan, Vahan V</creator><creator>Petrosyan, Samvel S</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20080124</creationdate><title>5-cycles and the Petersen graph</title><author>DeVos, Matt ; Mkrtchyan, Vahan V ; Petrosyan, Samvel S</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a654-a981bc3f4a110608e8058d346d01526b4c13dfb2f8b8ddd2aa39bfe3338730ce3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Computer Science - Discrete Mathematics</topic><toplevel>online_resources</toplevel><creatorcontrib>DeVos, Matt</creatorcontrib><creatorcontrib>Mkrtchyan, Vahan V</creatorcontrib><creatorcontrib>Petrosyan, Samvel S</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>DeVos, Matt</au><au>Mkrtchyan, Vahan V</au><au>Petrosyan, Samvel S</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>5-cycles and the Petersen graph</atitle><date>2008-01-24</date><risdate>2008</risdate><abstract>We show that if G is a connected bridgeless cubic graph whose every 2-factor
is comprised of cycles of length five then G is the Petersen graph.</abstract><doi>10.48550/arxiv.0801.3714</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.0801.3714 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_0801_3714 |
| source | arXiv.org |
| subjects | Computer Science - Discrete Mathematics |
| title | 5-cycles and the Petersen graph |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-20T13%3A04%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=5-cycles%20and%20the%20Petersen%20graph&rft.au=DeVos,%20Matt&rft.date=2008-01-24&rft_id=info:doi/10.48550/arxiv.0801.3714&rft_dat=%3Carxiv_GOX%3E0801_3714%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |