Sciweavers

    ENDM   2006
    Wall of Fame | Most Viewed ENDM-2006 Paper
    ENDM
    2006
    127views more  ENDM 2006»
    Greedy defining sets in graphs and Latin squares
    14 years 22 days ago
    Greedy defining sets in graphs and Latin squares
    Download  www.iasbs.ac.ir
    Greedy algorithm sometimes uses more than (G) colors while coloring a graph G. A greedy defining set is an object to eliminate these extra colors so that the greedy coloring resul...
    Manouchehr Zaker
    claim paper
    Read More »
    Disclaimer and Copyright Notice
    Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
    IdReadViewsTitleStatus
    1Download preprint from source127
    Greedy defining sets in graphs and Latin squares
    claim
    2Download preprint from source119
    The incidence game chromatic number
    claim
    3Download preprint from source96
    Exploring the complexity boundary between coloring and list-coloring
    claim
    4Download preprint from source91
    There are exactly five biplanes with k=11
    claim
    5Download preprint from source83
    Some characterizations of the exceptional planar embedding of W(2)
    claim
    6Download preprint from source77
    A Two-stage Model for a Day-ahead Paratransit Planning Problem
    claim
    7Download preprint from source75
    The structure and unlabelled enumeration of toroidal graphs with no K3, 3's
    claim
    8Download preprint from source74
    Antibandwidth of Complete k-Ary Trees
    claim
    9Download preprint from source73
    Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6
    claim
    10Download preprint from source70
    Quasirandomness in Graphs
    claim
    11Download preprint from source69
    Timetabling problems at the TU Eindhoven
    claim
    12Download preprint from source69
    General Delay Budgeting on Directed Acyclic Graphs with Applications in CAD
    claim
    13Download preprint from source68
    On Modular Decomposition Concepts: the case for Homogeneous Relations
    claim
    14Download preprint from source65
    Hamiltonian Chains in Hypergraphs
    claim
    15Download preprint from source61
    On isomorphic linear partitions in cubic graphs
    claim
    16Download preprint from source58
    Two disjoint negative cycles in a signed graph
    claim
    17Download preprint from source57
    One-point extensions of generalized hexagons and octagons
    claim
    18Download preprint from source57
    Update on the Extension of Good Linear Codes
    claim
    19Download preprint from source53
    A completely dynamic algorithm for split graphs
    claim
    20Download preprint from source50
    Generalized clique family inequalities for claw-free graphs
    claim
    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.