Sciweavers

    3471 search results - page 42 / 695
    » Obstacle Numbers of Graphs
    Sort
    View
    DM
    2007
    55views more  DM 2007»
    On the number of closed walks in vertex-transitive graphs
    15 years 3 months ago
    On the number of closed walks in vertex-transitive graphs
    Download  www.imfm.si
    Robert Jajcay, Aleksander Malnic, Dragan Marusic
    claim paper
    Read More »
    DM
    2007
    66views more  DM 2007»
    [r, s, t]-Chromatic numbers and hereditary properties of graphs
    15 years 3 months ago
    [r, s, t]-Chromatic numbers and hereditary properties of graphs
    Download  www.mathematik.tu-bs.de
    Arnfried Kemnitz, Massimiliano Marangio, Peter Mih...
    claim paper
    Read More »
    ENDM
    2007
    65views more  ENDM 2007»
    The crossing number of a projective graph is quadratic in the face-width
    15 years 3 months ago
    The crossing number of a projective graph is quadratic in the face-width
    Download  www.combinatorics.org
    Isidoro Gitler, Petr Hlinený, Jesús ...
    claim paper
    Read More »
    109
    Voted
    JGAA
    2007
    66views more  JGAA 2007»
    Estimating the Number of s-t Paths in a Graph
    15 years 3 months ago
    Estimating the Number of s-t Paths in a Graph
    Download  jgaa.info
    Ben Roberts, Dirk P. Kroese
    claim paper
    Read More »
    106
    Voted
    JGT
    2007
    76views more  JGT 2007»
    Total chromatic number of planar graphs with maximum degree ten
    15 years 3 months ago
    Total chromatic number of planar graphs with maximum degree ten
    Download  math.ecnu.edu.cn
    Weifan Wang
    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.