Coloring - PDFSEARCH.IO - Document Search Engine

Coloring
Results: 2565

#	Item
411	A new characterization of Pk -free graphs Eglantine Camby Universit´e Libre de Bruxelles D´epartement de Math´ematique Boulevard du Triomphe, 1050 Brussels, Belgium Add to Reading List Source URL: www.zaik.uni-koeln.de Language: English - Date: 2015-02-09 05:54:36 Graph theory Mathematics NP-complete problems Graph coloring Hypergraph Dominating set Ear decomposition Graph Line graph Modular decomposition
412	GREEN_LANTERN_COLORING_PAGES_1 Add to Reading List Source URL: www.dckids.com - Date: 2015-08-20 14:10:31
413	Complexity of the Packing Coloring Problem of Trees∗ Jiˇr´ı Fiala† Petr A. Golovach‡ Add to Reading List Source URL: iti.mff.cuni.cz Language: English - Date: 2016-02-04 05:53:37
414	Three-coloring triangle-free planar graphs in linear time∗ Zdenˇek Dvoˇr´ak† Ken-ichi Kawarabayashi‡ Robin Thomas§ Add to Reading List Source URL: iti.mff.cuni.cz Language: English - Date: 2016-02-04 05:53:37
415	An algorithm for two coloring of hypergraphs G´abor Heged˝ us Abstract Let r > 1 be a fix integer. Let H be an arbitrary r-uniform hypergraph. We give an algorithmic, elementary proof of the fact, that there exists a 2 Add to Reading List Source URL: iti.mff.cuni.cz Language: English - Date: 2016-02-04 05:53:37
416	2014 golf guy revised coloring vector.eps Add to Reading List Source URL: www.wwlcchamber.com Language: English - Date: 2015-04-02 15:30:15
417	AVOIDING RAINBOW INDUCED SUBGRAPHS IN VERTEX-COLORINGS MARIA AXENOVICH AND RYAN MARTIN Abstract. For a ﬁxed graph H on k vertices, and a graph G on at least k vertices, we write G −→ H if in any vertex-coloring of Add to Reading List Source URL: www.math.kit.edu Language: English - Date: 2015-11-10 14:19:35
418	reg4-n50-c512M-b1M.time.ps Add to Reading List Source URL: homepages.ecs.vuw.ac.nz Language: English - Date: 2008-10-16 17:32:45 Graph theory Graph coloring Matroid theory Polynomials Tutte polynomial Chromatic polynomial Matching Ear decomposition Spanning tree Graph Degree Connected component
419	An Application of Stahl’s Conjecture About the k-tuple Chromatic Numbers of Kneser Graphs Svata Poljak and Fred S. Roberts∗ Abstract A k-tuple coloring of a graph G assigns a set of k colors to each vertex of G so th Add to Reading List Source URL: www.dimacs.rutgers.edu Language: English - Date: 2008-07-28 10:11:57
420	Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search Scott Beamer EECS Department University of California Berkeley, California Add to Reading List Source URL: crd.lbl.gov Language: English - Date: 2013-03-15 00:51:18 Graph theory Graph connectivity Search algorithms Breadth-first search Graph traversal Spanning tree Strongly connected component Tree Ear decomposition Connected component Graph coloring Maximal independent set

UPDATE