Sciweavers

    2 search results - page 1 / 1
    » Branch-Width and Well-Quasi-Ordering in Matroids and Graphs
    Sort
    View
    JCT
    2002
    90views more  JCT 2002»
    Branch-Width and Well-Quasi-Ordering in Matroids and Graphs
    13 years 5 months ago
    Branch-Width and Well-Quasi-Ordering in Matroids and Graphs
    Download  homepages.cwi.nl
    James F. Geelen, A. M. H. Gerards, Geoff Whittle
    claim paper
    Read More »
    SIAMDM
    2008
    115views more  SIAMDM 2008»
    Rank-Width and Well-Quasi-Ordering
    13 years 5 months ago
    Rank-Width and Well-Quasi-Ordering
    Download  mathsci.kaist.ac.kr
    Robertson and Seymour (1990) proved that graphs of bounded tree-width are well-quasi-ordered by the graph minor relation. By extending their arguments, Geelen, Gerards, and Whittle...
    Sang-il Oum
    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.