Sciweavers

    7 search results - page 2 / 2
    » arscom 1999
    Sort
    View
    ARSCOM
    1999
    54views more  ARSCOM 1999»
    Refining the Graph Density Condition for the Existence of Almost K-factors
    13 years 5 months ago
    Refining the Graph Density Condition for the Existence of Almost K-factors
    Download  www.cs.tau.ac.il
    Alon and Yuster [4] have proven that if a fixed graph K on g vertices is (h + 1)-colorable, then any graph G with n vertices and minimum degree at least h h+1 n contains at least ...
    Noga Alon, Eldar Fischer
    claim paper
    Read More »
    ARSCOM
    1999
    97views more  ARSCOM 1999»
    The Size of the Smallest Strong Critical Set in a Latin Square
    13 years 5 months ago
    The Size of the Smallest Strong Critical Set in a Latin Square
    Download  www.cs.umanitoba.ca
    A critical set in a latin square is a set of entries in a latin square which can be embedded in only one latin square. Also, if any element of the critical set is deleted, the rema...
    John A. Bate, G. H. John van Rees
    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.