Sciweavers

    2 search results - page 1 / 1
    » On clique-perfect and K-perfect graphs
    Sort
    View
    SIAMDM
    2008
    101views more  SIAMDM 2008»
    Hamilton Cycles in Random Lifts of Directed Graphs
    13 years 5 months ago
    Hamilton Cycles in Random Lifts of Directed Graphs
    Download  www.math.cmu.edu
    An n-lift of a digraph K, is a digraph with vertex set V (K)
    Prasad Chebolu, Alan M. Frieze
    claim paper
    Read More »
    ENDM
    2008
    118views more  ENDM 2008»
    Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
    13 years 5 months ago
    Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
    Download  mate.dm.uba.ar
    A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
    Flavia Bonomo, Guillermo Durán, Francisco J...
    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.