Sciweavers

    DAM   2011
    Wall of Fame | Most Viewed DAM-2011 Paper
    DAM
    2011
    283views Theoretical Computer Science» more  DAM 2011»
    On the b-coloring of P4-tidy graphs
    13 years 7 months ago
    On the b-coloring of P4-tidy graphs
    Download  publicaciones.dc.uba.ar
    A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned to it. The b-chromatic ...
    Clara Inés Betancur Velasquez, Flavia Bonom...
    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 source283
    On the b-coloring of P4-tidy graphs
    claim
    2Download preprint from source250
    Weak sense of direction labelings and graph embeddings
    claim
    3Download preprint from source242
    An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays
    claim
    4Download preprint from source241
    On minimal Sturmian partial words
    claim
    5Download preprint from source225
    Hamiltonian index is NP-complete
    claim
    6Download preprint from source215
    A study of 3-arc graphs
    claim
    7Download preprint from source213
    Independence in connected graphs
    claim
    8Download preprint from source212
    A General Label Search to investigate classical graph search algorithms
    claim
    9Download preprint from source211
    Optimization problems in multiple subtree graphs
    claim
    10Download preprint from source210
    Untangling planar graphs from a specified vertex position - Hard cases
    claim
    11Download preprint from source209
    1-factor covers of regular graphs
    claim
    12Download preprint from source208
    Noisy colored point set matching
    claim
    13Download preprint from source203
    On the expressive power of CNF formulas of bounded tree- and clique-width
    claim
    14Download preprint from source200
    Matchability and k-maximal matchings
    claim
    15Download preprint from source197
    Powers of cycles, powers of paths, and distance graphs
    claim
    16Download preprint from source196
    Minimum sum set coloring of trees and line graphs of trees
    claim
    17Download preprint from source196
    Generalization of matching extensions in graphs (III)
    claim
    18Download preprint from source192
    Fractional weak discrepancy and split semiorders
    claim
    19Download preprint from source178
    A theory of decomposition into prime factors of layered interconnection networks
    claim
    20Download preprint from source176
    Triangular line graphs and word sense disambiguation
    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.