Sciweavers

    98
    Voted
    JCT
    2011
    86views more  JCT 2011»
    Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
    14 years 9 months ago
    Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
    Download  www.maths.qmul.ac.uk
    The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph i...
    Mark Bilinski, Bill Jackson, Jie Ma, Xingxing Yu
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.