Sciweavers

    122 search results - page 2 / 25
    » On pancyclism in hamiltonian graphs
    Sort
    View
    JGAA
    2007
    81views more  JGAA 2007»
    The Traveling Salesman Problem for Cubic Graphs
    13 years 5 months ago
    The Traveling Salesman Problem for Cubic Graphs
    Download  www.emis.de
    We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3
    David Eppstein
    claim paper
    Read More »
    DM
    2008
    63views more  DM 2008»
    Nomadic decompositions of bidirected complete graphs
    13 years 5 months ago
    Nomadic decompositions of bidirected complete graphs
    Download  www.people.vcu.edu
    We use K n to denote the bidirected complete graph on n vertices. A nomadic Hamiltonian decomposition of K n is a Hamiltonian decomposition, with the additional property that &quo...
    Daniel W. Cranston
    claim paper
    Read More »
    CCCG
    2006
    87views Computational Geometry» more  CCCG 2006»
    Hamiltonian Cycles in Triangular Grids
    13 years 7 months ago
    Hamiltonian Cycles in Triangular Grids
    Download  www.ams.sunysb.edu
    We study the Hamiltonian Cycle problem in graphs induced by subsets of the vertices of the tiling of the plane with equilateral triangles. By analogy with grid graphs we call such...
    Valentin Polishchuk, Esther M. Arkin, Joseph S. B....
    claim paper
    Read More »
    ARSCOM
    2006
    72views more  ARSCOM 2006»
    A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs
    13 years 5 months ago
    A Sufficient Condition for Quasi-Claw-Free Hamiltonian Graphs
    Download  ms.ntcb.edu.tw
    Abstract. There are several well-known and important hamiltonian results for claw-free graphs but only a few are concerned with quasi-claw-free graphs. In this note, we provide a n...
    Jou-Ming Chang, An-Hang Chen
    claim paper
    Read More »
    ARSCOM
    2004
    73views more  ARSCOM 2004»
    2-Factors in Hamiltonian Graphs
    13 years 5 months ago
    2-Factors in Hamiltonian Graphs
    Download  www.math.uni-rostock.de
    We show that every hamiltonian claw-free graph with a vertex x of degree d(x) 7 has a 2-factor consisting of exactly two cycles.
    Florian Pfender
    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.