Sciweavers

    APPML
    2005
    67views more  APPML 2005»
    Semiharmonic bicyclic graphs
    13 years 11 months ago
    Semiharmonic bicyclic graphs
    Download  www.mathematik.uni-bielefeld.de
    Let the trunk of a graph G be the graph obtained by removing all leaves of G. We prove that, for every integer c 2, there are at most finitely many trunks of semiharmonic graphs ...
    Stefan Grünewald, Dragan Stevanovic
    claim paper
    Read More »
    DM
    2010
    83views more  DM 2010»
    Packing edge-disjoint cycles in graphs and the cyclomatic number
    13 years 11 months ago
    Packing edge-disjoint cycles in graphs and the cyclomatic number
    Download  www.tu-ilmenau.de
    For a graph G let
    Jochen Harant, Dieter Rautenbach, Peter Recht, Fri...
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.