Supereulerian Graphs and the Petersen Graph

A graphG is supereulerian if G has a spanning eulerian subgraph.Boesch et al.[J.Graph Theory,1,79–84（1977）]proposed the problem of characterizing supereulerian graphs.In this paper,we prove that any 3-edge-connected graph with at most 11 edge-cuts of size 3 is supereulerian if and only if it cannot...

Full description

Saved in:
Bibliographic Details
Published in:Acta mathematica Sinica. English series 2014-02, Vol.30 (2), p.291-304
Main Authors: Li, Xiao Min, Lei, Lan, Lai, Hong-Jian, Zhang, Meng
Format: Article
Language:English
Subjects:
Graph theory
Graphs
Mathematical models
Mathematics
Mathematics and Statistics
Petersen图
Studies
Theorems
丝氨酸
图论
欧拉生成子图
超欧拉图
连通图
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c375t-5697bb89f53e3888b3716692f1013ccb846bc1485394f199362d3c87c536b3303
cites cdi_FETCH-LOGICAL-c375t-5697bb89f53e3888b3716692f1013ccb846bc1485394f199362d3c87c536b3303
container_end_page 304
container_issue 2
container_start_page 291
container_title Acta mathematica Sinica. English series
container_volume 30
creator Li, Xiao Min
Lei, Lan
Lai, Hong-Jian
Zhang, Meng
description A graphG is supereulerian if G has a spanning eulerian subgraph.Boesch et al.[J.Graph Theory,1,79–84（1977）]proposed the problem of characterizing supereulerian graphs.In this paper,we prove that any 3-edge-connected graph with at most 11 edge-cuts of size 3 is supereulerian if and only if it cannot be contractible to the Petersen graph.This extends a former result of Catlin and Lai[J.Combin.Theory,Ser.B,66,123–139（1996）].
doi_str_mv 10.1007/s10114-014-2272-y
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1506362841</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>48941699</cqvip_id><sourcerecordid>1506362841</sourcerecordid><originalsourceid>FETCH-LOGICAL-c375t-5697bb89f53e3888b3716692f1013ccb846bc1485394f199362d3c87c536b3303</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouH78AG8VL4JUM833URZdhQUF9Rza7HQ_6LbdpD3svzdLi4gHDyFheJ6ZyUvIFdB7oFQ9BKAAPKXxZJnK0v0RmQBnJlUS1PH41gLkKTkLYUOpEIbKCbn76Fv02Ffo13mdzHzerkKS14ukW2Hyjh36gGP9gpyUeRXwcrzPydfz0-f0JZ2_zV6nj_PUMSW6VEijikKbUjBkWuuCKZDSZGVckTlXaC4LB1wLZngJxjCZLZjTygkmC8YoOye3Q9_WN7seQ2e36-CwqvIamz5YEFRGSXOI6M0fdNP0vo7bWeBKgRBKqkjBQDnfhOCxtK1fb3O_t0DtIT47xGdjfPYQn91HJxucENl6if5X53-k63HQqqmXu-j9TOLacJDxt981YnqE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1477155767</pqid></control><display><type>article</type><title>Supereulerian Graphs and the Petersen Graph</title><source>ABI/INFORM Global</source><source>Springer Nature</source><creator>Li, Xiao Min ; Lei, Lan ; Lai, Hong-Jian ; Zhang, Meng</creator><creatorcontrib>Li, Xiao Min ; Lei, Lan ; Lai, Hong-Jian ; Zhang, Meng</creatorcontrib><description>A graphG is supereulerian if G has a spanning eulerian subgraph.Boesch et al.[J.Graph Theory,1,79–84（1977）]proposed the problem of characterizing supereulerian graphs.In this paper,we prove that any 3-edge-connected graph with at most 11 edge-cuts of size 3 is supereulerian if and only if it cannot be contractible to the Petersen graph.This extends a former result of Catlin and Lai[J.Combin.Theory,Ser.B,66,123–139（1996）].</description><identifier>ISSN: 1439-8516</identifier><identifier>EISSN: 1439-7617</identifier><identifier>DOI: 10.1007/s10114-014-2272-y</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Graph theory ; Graphs ; Mathematical models ; Mathematics ; Mathematics and Statistics ; Petersen图 ; Studies ; Theorems ; 丝氨酸 ; 图论 ; 欧拉生成子图 ; 超欧拉图 ; 连通图</subject><ispartof>Acta mathematica Sinica. English series, 2014-02, Vol.30 (2), p.291-304</ispartof><rights>Institute of Mathematics, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Chinese Mathematical Society and Springer-Verlag Berlin Heidelberg 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c375t-5697bb89f53e3888b3716692f1013ccb846bc1485394f199362d3c87c536b3303</citedby><cites>FETCH-LOGICAL-c375t-5697bb89f53e3888b3716692f1013ccb846bc1485394f199362d3c87c536b3303</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/85800X/85800X.jpg</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/1477155767?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,780,784,11687,27923,27924,36059,36060,44362</link.rule.ids></links><search><creatorcontrib>Li, Xiao Min</creatorcontrib><creatorcontrib>Lei, Lan</creatorcontrib><creatorcontrib>Lai, Hong-Jian</creatorcontrib><creatorcontrib>Zhang, Meng</creatorcontrib><title>Supereulerian Graphs and the Petersen Graph</title><title>Acta mathematica Sinica. English series</title><addtitle>Acta. Math. Sin.-English Ser</addtitle><addtitle>Acta Mathematica Sinica</addtitle><description>A graphG is supereulerian if G has a spanning eulerian subgraph.Boesch et al.[J.Graph Theory,1,79–84（1977）]proposed the problem of characterizing supereulerian graphs.In this paper,we prove that any 3-edge-connected graph with at most 11 edge-cuts of size 3 is supereulerian if and only if it cannot be contractible to the Petersen graph.This extends a former result of Catlin and Lai[J.Combin.Theory,Ser.B,66,123–139（1996）].</description><subject>Graph theory</subject><subject>Graphs</subject><subject>Mathematical models</subject><subject>Mathematics</subject><subject>Mathematics and Statistics</subject><subject>Petersen图</subject><subject>Studies</subject><subject>Theorems</subject><subject>丝氨酸</subject><subject>图论</subject><subject>欧拉生成子图</subject><subject>超欧拉图</subject><subject>连通图</subject><issn>1439-8516</issn><issn>1439-7617</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp9kE1LxDAQhoMouH78AG8VL4JUM833URZdhQUF9Rza7HQ_6LbdpD3svzdLi4gHDyFheJ6ZyUvIFdB7oFQ9BKAAPKXxZJnK0v0RmQBnJlUS1PH41gLkKTkLYUOpEIbKCbn76Fv02Ffo13mdzHzerkKS14ukW2Hyjh36gGP9gpyUeRXwcrzPydfz0-f0JZ2_zV6nj_PUMSW6VEijikKbUjBkWuuCKZDSZGVckTlXaC4LB1wLZngJxjCZLZjTygkmC8YoOye3Q9_WN7seQ2e36-CwqvIamz5YEFRGSXOI6M0fdNP0vo7bWeBKgRBKqkjBQDnfhOCxtK1fb3O_t0DtIT47xGdjfPYQn91HJxucENl6if5X53-k63HQqqmXu-j9TOLacJDxt981YnqE</recordid><startdate>20140201</startdate><enddate>20140201</enddate><creator>Li, Xiao Min</creator><creator>Lei, Lan</creator><creator>Lai, Hong-Jian</creator><creator>Zhang, Meng</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>M2O</scope><scope>M2P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20140201</creationdate><title>Supereulerian Graphs and the Petersen Graph</title><author>Li, Xiao Min ; Lei, Lan ; Lai, Hong-Jian ; Zhang, Meng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c375t-5697bb89f53e3888b3716692f1013ccb846bc1485394f199362d3c87c536b3303</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Graph theory</topic><topic>Graphs</topic><topic>Mathematical models</topic><topic>Mathematics</topic><topic>Mathematics and Statistics</topic><topic>Petersen图</topic><topic>Studies</topic><topic>Theorems</topic><topic>丝氨酸</topic><topic>图论</topic><topic>欧拉生成子图</topic><topic>超欧拉图</topic><topic>连通图</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Li, Xiao Min</creatorcontrib><creatorcontrib>Lei, Lan</creatorcontrib><creatorcontrib>Lai, Hong-Jian</creatorcontrib><creatorcontrib>Zhang, Meng</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Research Library</collection><collection>ProQuest Science Journals</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Acta mathematica Sinica. English series</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Xiao Min</au><au>Lei, Lan</au><au>Lai, Hong-Jian</au><au>Zhang, Meng</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Supereulerian Graphs and the Petersen Graph</atitle><jtitle>Acta mathematica Sinica. English series</jtitle><stitle>Acta. Math. Sin.-English Ser</stitle><addtitle>Acta Mathematica Sinica</addtitle><date>2014-02-01</date><risdate>2014</risdate><volume>30</volume><issue>2</issue><spage>291</spage><epage>304</epage><pages>291-304</pages><issn>1439-8516</issn><eissn>1439-7617</eissn><abstract>A graphG is supereulerian if G has a spanning eulerian subgraph.Boesch et al.[J.Graph Theory,1,79–84（1977）]proposed the problem of characterizing supereulerian graphs.In this paper,we prove that any 3-edge-connected graph with at most 11 edge-cuts of size 3 is supereulerian if and only if it cannot be contractible to the Petersen graph.This extends a former result of Catlin and Lai[J.Combin.Theory,Ser.B,66,123–139（1996）].</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s10114-014-2272-y</doi><tpages>14</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1439-8516
ispartof Acta mathematica Sinica. English series, 2014-02, Vol.30 (2), p.291-304
issn 1439-8516
1439-7617
language eng
recordid cdi_proquest_miscellaneous_1506362841
source ABI/INFORM Global; Springer Nature
subjects Graph theory
Graphs
Mathematical models
Mathematics
Mathematics and Statistics
Petersen图
Studies
Theorems
丝氨酸
图论
欧拉生成子图
超欧拉图
连通图
title Supereulerian Graphs and the Petersen Graph
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T16%3A57%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Supereulerian%20Graphs%20and%20the%20Petersen%20Graph&rft.jtitle=Acta%20mathematica%20Sinica.%20English%20series&rft.au=Li,%20Xiao%20Min&rft.date=2014-02-01&rft.volume=30&rft.issue=2&rft.spage=291&rft.epage=304&rft.pages=291-304&rft.issn=1439-8516&rft.eissn=1439-7617&rft_id=info:doi/10.1007/s10114-014-2272-y&rft_dat=%3Cproquest_cross%3E1506362841%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c375t-5697bb89f53e3888b3716692f1013ccb846bc1485394f199362d3c87c536b3303%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1477155767&rft_id=info:pmid/&rft_cqvip_id=48941699&rfr_iscdi=true