Sciweavers

    JCT
    2011
    56views more  JCT 2011»
    Twins of rayless graphs
    12 years 11 months ago
    Twins of rayless graphs
    Download  www.math.ryerson.ca
    Two non-isomorphic graphs are twins if each is isomorphic to a subgraph of the other. We prove that a rayless graph has either infinitely many twins or none.
    Anthony Bonato, Henning Bruhn, Reinhard Diestel, P...
    claim paper
    Read More »
    COMBINATORICA
    2010
    121views Machine Learning» more  COMBINATORICA 2010»
    Every rayless graph has an unfriendly partition
    12 years 11 months ago
    Every rayless graph has an unfriendly partition
    Download  www.math.uni-hamburg.de
    We prove that every rayless graph has an unfriendly partition.
    Henning Bruhn, Reinhard Diestel, Agelos Georgakopo...
    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.