View Item 

Show simple item record

Even cycles in graphs
dc.contributor.authorConlon, Joseph G.en_US
dc.date.accessioned2006-04-19T13:56:53Z
dc.date.available2006-04-19T13:56:53Z
dc.date.issued2004-03en_US
dc.identifier.citationConlon, Joseph G. (2004)."Even cycles in graphs." Journal of Graph Theory 45(3): 163-223. <http://hdl.handle.net/2027.42/34893>en_US
dc.identifier.issn0364-9024en_US
dc.identifier.issn1097-0118en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/34893
dc.description.abstractLet G be a 3-connected simple graph of minimum degree 4 on at least six vertices. The author proves the existence of an even cycle C in G such that G-V ( C ) is connected and G-E ( C ) is 2-connected. The result is related to previous results of Jackson, and Thomassen and Toft. Thomassen and Toft proved that G contains an induced cycle C such that both G-V ( C ) and G-E ( C ) is 2-connected. G does not in general contain an even cycle such that G-V ( C ) is 2-connected. © 2004 Wiley Periodicals, Inc. J Graph Theory 45: 163–223, 2004en_US
dc.format.extent916489 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherWiley Subscription Services, Inc., A Wiley Companyen_US
dc.subject.otherMathematics and Statisticsen_US
dc.titleEven cycles in graphsen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelMathematicsen_US
dc.subject.hlbtoplevelScienceen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Mathematics, University of Michigan, Ann Arbor, Michigan 48109-1109 ; Department of Mathematics, University of Michigan, Ann Arbor, Michigan 48109-1109.en_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/34893/1/10156_ftp.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1002/jgt.10156en_US
dc.identifier.sourceJournal of Graph Theoryen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
10156_ftp.pdf
Size:
895.0KB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.