On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman, Ondˇrej Pangr´ac Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Malostransk´e n´

Source URL: kam.mff.cuni.cz

• Graph theory
• Graph operations
• Graph coloring
• Matroid theory
• Edge contraction
• Graph
• Bipartite graph
• Ear decomposition
• Pathwidth
• Line graph

Concept Graphs without Negations: Standardmodels and Standardgraphs Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,

Source URL: www.dr-dau.net

• Graph theory
• Graph coloring
• Ear decomposition
• Matroid theory
• Morphisms
• Line graph
• Interval edge coloring

A. Daneshgar: Extended abstract of my talk at IUTFebruaryDo Graphs Admit Topological Field Theories? Amir Daneshgar

Source URL: sharif.ir

• Graph theory
• Mathematics
• Graph operations
• NP-complete problems
• Graph coloring
• Topological graph theory
• Line graph
• Graph homomorphism
• Graph
• Graph property
• Signed graph

DAY AND NIGHT Coloring Book Color and learn what you can do to prevent Zika Virus. Kentucky

Source URL: healthalerts.ky.gov

arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´

Source URL: www.grupolys.org

• Graph theory
• NP-complete problems
• Spanning tree
• Axiom of choice
• Graph coloring
• Tree

Distributed Computing Prof. R. Wattenhofer BA/SA: Online Graph Exploration

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Online algorithm
• Line graph
• Graph
• Graph coloring
• Operations research
• Edsger W. Dijkstra
• Graph traversal
• Edge coloring

Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs Michael R. Fellows1 , Guillaume Fertin2 , Danny Hermelin?3 , and St´ephane Vialette4 1 School of Electrical Engineering and Computer

Source URL: pagesperso.lina.univ-nantes.fr

• Graph theory
• Graph coloring
• Treewidth
• Color-coding
• Matching
• Clique
• Graph minor
• Tree decomposition

CS264: Homework #5 Due by midnight on Wednesday, October 29, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at http://rishig.sc

Source URL: theory.stanford.edu

• Graph theory
• NP-complete problems
• Clique
• Clique cover
• Graph coloring

Get to Know Germany Coloring and Activity Book Bakery Bäckere i

Source URL: download.diplo.de

• Geography of Europe
• Europe
• International relations
• Germany
• Thuringia

Prof. Roger Wattenhofer http://www.dcg.ethz.ch Semester/Master Thesis Distributed Graph Coloring Motivation and Informal Description

Source URL: disco.ethz.ch

• Graph theory
• Mathematics
• Theoretical computer science
• NP-complete problems
• Distributed computing
• Symposium on Principles of Distributed Computing
• ACM SIGACT
• Graph coloring
• Algorithm
• Independent set
• Dijkstra Prize
• Symposium on Parallelism in Algorithms and Architectures