Graph structure theorem

Results: 29



#Item
1OPTIMIZING THE GRAPH MINORS WEAK STRUCTURE THEOREM ARCHONTIA C. GIANNOPOULOU† ‡ AND DIMITRIOS M. THILIKOS† § Abstract. One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint

OPTIMIZING THE GRAPH MINORS WEAK STRUCTURE THEOREM ARCHONTIA C. GIANNOPOULOU† ‡ AND DIMITRIOS M. THILIKOS† § Abstract. One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint

Add to Reading List

Source URL: users.uoa.gr

- Date: 2014-06-11 17:30:35
    2Lecture 25  Spectral Graph Theory Planar Graphs, part 1 December 2, 2009

    Lecture 25 Spectral Graph Theory Planar Graphs, part 1 December 2, 2009

    Add to Reading List

    Source URL: www.cs.yale.edu

    Language: English - Date: 2012-08-24 09:50:05
    3August 4, :42 WSPC - Proceedings Trim Size: 9.75in x 6.5in

    August 4, :42 WSPC - Proceedings Trim Size: 9.75in x 6.5in

    Add to Reading List

    Source URL: www.jsbi.org

    Language: English - Date: 2008-12-11 03:31:28
    4Stars and Bonds in Crossing-Critical Graphs Petr Hlinˇ en´ y1 and Gelasio Salazar2 1

    Stars and Bonds in Crossing-Critical Graphs Petr Hlinˇ en´ y1 and Gelasio Salazar2 1

    Add to Reading List

    Source URL: www.fi.muni.cz

    Language: English - Date: 2008-09-19 09:20:43
    5On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada

    On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada

    Add to Reading List

    Source URL: www.mrfellows.net

    Language: English - Date: 2009-10-06 02:54:05
    6CCCG 2009, Vancouver, BC, August 17–19, 2009  Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice David Flores-Peñaloza∗

    CCCG 2009, Vancouver, BC, August 17–19, 2009 Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice David Flores-Peñaloza∗

    Add to Reading List

    Source URL: cccg.ca

    Language: English - Date: 2009-09-02 14:32:22
    7Planar Emulators Conjecture Is Nearly True for Cubic Graphs Martin Derkaa , Petr Hlinˇen´ yb,1 a David

    Planar Emulators Conjecture Is Nearly True for Cubic Graphs Martin Derkaa , Petr Hlinˇen´ yb,1 a David

    Add to Reading List

    Source URL: www.fi.muni.cz

    Language: English - Date: 2013-12-16 02:39:42
    8Topological Algorithms for Graphs on Surfaces (Algorithmes topologiques pour les graphes tracés sur des surfaces) par

    Topological Algorithms for Graphs on Surfaces (Algorithmes topologiques pour les graphes tracés sur des surfaces) par

    Add to Reading List

    Source URL: www.di.ens.fr

    Language: English - Date: 2012-05-21 03:16:48
    9Counting Graph Homomorphisms Christian Borgs, Jennifer Chayes, L´aszl´o Lov´asz, Vera T. S´os, Katalin Vesztergombi FebruaryContents

    Counting Graph Homomorphisms Christian Borgs, Jennifer Chayes, L´aszl´o Lov´asz, Vera T. S´os, Katalin Vesztergombi FebruaryContents

    Add to Reading List

    Source URL: research.microsoft.com

    Language: English - Date: 2006-02-06 04:19:34
    10. . Approximate Counting of Matchings in (3, 3)-Hypergraphs? Andrzej Dudek??

    . . Approximate Counting of Matchings in (3, 3)-Hypergraphs? Andrzej Dudek??

    Add to Reading List

    Source URL: theory.cs.uni-bonn.de

    Language: English - Date: 2014-02-28 04:12:51