Topological graph

Results: 332



#Item
1TOPOLOGICAL CRYSTALS JOHN C. BAEZ Abstract. Sunada’s work on topological crystallography emphasizes the role of the ‘maximal abelian cover’ of a graph X. This is a covering space of X for which the group of deck tr

TOPOLOGICAL CRYSTALS JOHN C. BAEZ Abstract. Sunada’s work on topological crystallography emphasizes the role of the ‘maximal abelian cover’ of a graph X. This is a covering space of X for which the group of deck tr

Add to Reading List

Source URL: math.ucr.edu

- Date: 2016-08-28 22:10:34
    2TOPOLOGICAL PRINCIPLES IN CARTOGRAPHY James P. Corbett ABSTRACT CHARACTER OF A MAP A map may be described as a linear graph embedded in a orientable, two-dimen sional manifold. A manifold, aside from being a two-dimensio

    TOPOLOGICAL PRINCIPLES IN CARTOGRAPHY James P. Corbett ABSTRACT CHARACTER OF A MAP A map may be described as a linear graph embedded in a orientable, two-dimen sional manifold. A manifold, aside from being a two-dimensio

    Add to Reading List

    Source URL: mapcontext.com

    - Date: 2008-08-29 22:59:39
      36.006 Intro to Algorithms  QUIZ 2 REVIEW NOTES - Part 2 April 12, 2011

      6.006 Intro to Algorithms QUIZ 2 REVIEW NOTES - Part 2 April 12, 2011

      Add to Reading List

      Source URL: courses.csail.mit.edu

      Language: English - Date: 2011-04-12 22:48:03
      4On Topological Minors in Random Simplicial Complexes∗ Anna Gundert† Uli Wagner‡  arXiv:1404.2106v2 [math.CO] 4 May 2015

      On Topological Minors in Random Simplicial Complexes∗ Anna Gundert† Uli Wagner‡ arXiv:1404.2106v2 [math.CO] 4 May 2015

      Add to Reading List

      Source URL: arxiv.org

      Language: English - Date: 2015-05-04 22:06:38
      5Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs.

      Note to other teachers and users of these slides: We would be delighted if you found this our material useful in giving your own lectures. Feel free to use these slides verbatim, or to modify them to fit your own needs.

      Add to Reading List

      Source URL: mmds.org

      Language: English - Date: 2014-08-11 13:15:52
      6UNIVERSITÄT DORTMUND  FACHBEREICH INFORMATIK Diplomarbeit

      UNIVERSITÄT DORTMUND FACHBEREICH INFORMATIK Diplomarbeit

      Add to Reading List

      Source URL: ls11-www.cs.tu-dortmund.de

      Language: English - Date: 2008-07-03 09:38:15
      7The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin

      The planar slope-number of planar partial 3-trees of bounded degree Vít Jelínek, Eva Jelínková, Jan Kratochvíl, Bernard Lidický, Marek Tesaˇr and Tomáš Vyskoˇcil Charles University in Prague University of Illin

      Add to Reading List

      Source URL: orion.math.iastate.edu

      Language: English - Date: 2014-08-22 14:45:55
      8Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague  Graph: G = (V , E ), V finite, E ⊆

      Simple realizability of complete abstract topological graphs simplified Jan Kynˇcl Charles University, Prague Graph: G = (V , E ), V finite, E ⊆

      Add to Reading List

      Source URL: kam.mff.cuni.cz

      Language: English - Date: 2015-09-15 10:40:14
      9Spectral graph theory and its applications Daniel A. Spielman Spectral graph theory—the study of the eigenvectors and eigenvalues of matrices associated with graphs—is a large field with many beautiful results. Most

      Spectral graph theory and its applications Daniel A. Spielman Spectral graph theory—the study of the eigenvectors and eigenvalues of matrices associated with graphs—is a large field with many beautiful results. Most

      Add to Reading List

      Source URL: www.cs.yale.edu

      Language: English - Date: 2005-06-30 12:02:51
      10Mixed Volume Techniques for Embeddings of Laman Graphs Reinhard Steffens∗, Thorsten Theobald† Abstract We use Bernstein’s Theorem [1] to obtain combinatorial bounds for the

      Mixed Volume Techniques for Embeddings of Laman Graphs Reinhard Steffens∗, Thorsten Theobald† Abstract We use Bernstein’s Theorem [1] to obtain combinatorial bounds for the

      Add to Reading List

      Source URL: www.math.uni-frankfurt.de

      Language: English - Date: 2008-06-23 09:41:53