Sciweavers

    ARSCOM
    1999
    57views more  ARSCOM 1999»
    Minimal Partitions of a Graph
    14 years 4 days ago
    Minimal Partitions of a Graph
    Download  www.math.siu.edu
    For a given graph G, we fix s, and partition the vertex set into s classes, so that any given class contains few edges. The result gives a partition (U1,
    Thomas Dale Porter
    claim paper
    Read More »
    ARSCOM
    1999
    51views more  ARSCOM 1999»
    The Application of Determining Sets to Projective Configurations
    14 years 4 days ago
    The Application of Determining Sets to Projective Configurations
    Download  bkocay.cs.umanitoba.ca
    William Kocay, Ryan Szypowski
    claim paper
    Read More »
    ARSCOM
    1999
    44views more  ARSCOM 1999»
    Bounds on the Total Redundance and Efficiency of a Graph
    14 years 4 days ago
    Bounds on the Total Redundance and Efficiency of a Graph
    Download  www.cs.clemson.edu
    Wayne Goddard, Ortrud Oellermann, Peter J. Slater,...
    claim paper
    Read More »
    ARSCOM
    1999
    57views more  ARSCOM 1999»
    On Complementary Consecutive Labelings of Octahedron
    14 years 4 days ago
    On Complementary Consecutive Labelings of Octahedron
    Download  lib.ck.tp.edu.tw
    Qu Anjing
    claim paper
    Read More »
    ARSCOM
    1999
    59views more  ARSCOM 1999»
    Self-complementary circulant graphs
    14 years 4 days ago
    Self-complementary circulant graphs
    Download  www.cs.uleth.ca
    Brian Alspach, Joy Morris, V. Vilfred
    claim paper
    Read More »
    ARSCOM
    1999
    54views more  ARSCOM 1999»
    Refining the Graph Density Condition for the Existence of Almost K-factors
    14 years 4 days 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
    14 years 4 days 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.