Sciweavers

    DM
    2000
    91views more  DM 2000»

    Perfection thickness of graphs

    13 years 11 months ago
    Perfection thickness of graphs
    Download  www.math.uiuc.edu
    We determine the order of growth of the worst-case number of perfect subgraphs needed to cover an n-vertex graph.
    Hirotsugu Asari, Tao Jiang, André Künd
    claim paper
    Added 18 Dec 2010
    Updated 18 Dec 2010
    Type Journal
    Year 2000
    Where DM
    Authors Hirotsugu Asari, Tao Jiang, André Kündgen, Douglas B. West
    Comments (0)
    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.