Sciweavers

    347 search results - page 10 / 70
    » Schaefer's theorem for graphs
    Sort
    View
    ICALP
    2010
    Springer
    104views Programming Languages» more  ICALP 2010»
    Graph Homomorphisms with Complex Values: A Dichotomy Theorem
    15 years 9 months ago
    Graph Homomorphisms with Complex Values: A Dichotomy Theorem
    Download  pages.cs.wisc.edu
    Jin-yi Cai, Xi Chen, Pinyan Lu
    claim paper
    Read More »
    CORR
    2010
    Springer
    68views Education» more  CORR 2010»
    A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights
    15 years 4 months ago
    A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights
    Download  pages.cs.wisc.edu
    Jin-yi Cai, Xi Chen
    claim paper
    Read More »
    COMBINATORICS
    2006
    91views more  COMBINATORICS 2006»
    Proof of an Intersection Theorem via Graph Homomorphisms
    15 years 4 months ago
    Proof of an Intersection Theorem via Graph Homomorphisms
    Download  www.wisdom.weizmann.ac.il
    Irit Dinur, Ehud Friedgut
    claim paper
    Read More »
    JCT
    2008
    70views more  JCT 2008»
    Claw-free graphs. IV. Decomposition theorem
    15 years 4 months ago
    Claw-free graphs. IV. Decomposition theorem
    Download  www.columbia.edu
    Maria Chudnovsky, Paul D. Seymour
    claim paper
    Read More »
    JCT
    2006
    47views more  JCT 2006»
    A map colour theorem for the union of graphs
    15 years 4 months ago
    A map colour theorem for the union of graphs
    Download  www.imfm.si
    Michael Stiebitz, Riste Skrekovski
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    i2PDF i2Img i2Text i2OCR i2Symbol i2Type i2Speak i2Style i2Arabic i2Bopomo Latex Equation Editor
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2026, USA.