Sciweavers

    JGT
    2007
    64views more  JGT 2007»
    Finite symmetric graphs with two-arc transitive quotients II
    13 years 4 months ago
    Finite symmetric graphs with two-arc transitive quotients II
    Download  www.ms.unimelb.edu.au
    Zaiping Lu, Sanming Zhou
    claim paper
    Read More »
    JGT
    2007
    55views more  JGT 2007»
    Hamilton cycles in prisms
    13 years 4 months ago
    Hamilton cycles in prisms
    Download  cam.zcu.cz
    Tomás Kaiser, Zdenek Ryjácek, Daniel...
    claim paper
    Read More »
    JGT
    2007
    73views more  JGT 2007»
    Independence number and clique minors
    13 years 4 months ago
    Independence number and clique minors
    Download  www.math.ucf.edu
    Ken-ichi Kawarabayashi, Zi-Xia Song
    claim paper
    Read More »
    JGT
    2007
    59views more  JGT 2007»
    Hereditary properties of combinatorial structures: Posets and oriented graphs
    13 years 4 months ago
    Hereditary properties of combinatorial structures: Posets and oriented graphs
    Download  www.math.uiuc.edu
    József Balogh, Béla Bollobás,...
    claim paper
    Read More »
    JGT
    2007
    64views more  JGT 2007»
    Interval Tournaments
    13 years 4 months ago
    Interval Tournaments
    Download  academic.udayton.edu
    David E. Brown, Arthur H. Busch, J. Richard Lundgr...
    claim paper
    Read More »
    JGT
    2007
    85views more  JGT 2007»
    On graphs with subgraphs having large independence numbers
    13 years 4 months ago
    On graphs with subgraphs having large independence numbers
    Download  www.math.ucla.edu
    : Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...
    Noga Alon, Benny Sudakov
    claim paper
    Read More »
    JGT
    2007
    146views more  JGT 2007»
    Compatible circuit decompositions of 4-regular graphs
    13 years 4 months ago
    Compatible circuit decompositions of 4-regular graphs
    Download  www.maths.qmw.ac.uk
    A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...
    Herbert Fleischner, François Genest, Bill J...
    claim paper
    Read More »
    JGT
    2007
    43views more  JGT 2007»
    Tripartite Ramsey numbers for paths
    13 years 4 months ago
    Tripartite Ramsey numbers for paths
    Download  web.cs.wpi.edu
    András Gyárfás, Miklós...
    claim paper
    Read More »
    JGT
    2007
    81views more  JGT 2007»
    Maximum directed cuts in acyclic digraphs
    13 years 4 months ago
    Maximum directed cuts in acyclic digraphs
    Download  people.maths.ox.ac.uk
    It is easily shown that every digraph with m edges has a directed cut of size at least m/4, and that 1/4 cannot be replaced by any larger constant. We investigate the size of a la...
    Noga Alon, Béla Bollobás, Andr&aacut...
    claim paper
    Read More »
    JGT
    2007
    68views more  JGT 2007»
    Tutte sets in graphs I: Maximal tutte sets and D-graphs
    13 years 4 months ago
    Tutte sets in graphs I: Maximal tutte sets and D-graphs
    Download  www.dur.ac.uk
    Douglas Bauer, Hajo Broersma, Aurora Morgana, Edwa...
    claim paper
    Read More »
    1234next ›last »
    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.