Coloring - PDFSEARCH.IO - Document Search Engine

Coloring
Results: 2565

#	Item
241	Multiply chorded cycles Ronald Gould∗ Paul Horn† Colton Magnant‡ Add to Reading List Source URL: web.cs.du.edu Language: English - Date: 2012-10-18 11:53:54 Extremal graph theory Neighbourhood Cycle Graph minor Graph coloring Cycle index Tree
242	The freezing threshold for k-colourings of a random graph.∗ Michael Molloy† April 28, 2016 Abstract We determine the exact value of the freezing threshold, rk , for k-colourings of a random graph when Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2016-04-28 21:24:02 Graph coloring Kempe chain Neighbourhood Tree Regular graph Degree
243	June 23, :19 WSPC - Proceedings Trim Size: 9in x 6in Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:57:08 Graph coloring NP-complete problems Graph theory Matching Color-coding Graph Chromatic polynomial Tree-depth
244	Maximum Motif Problem in Vertex-Colored Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:28:57 NP-complete problems Graph coloring Graph connectivity Combinatorial optimization Matching Vertex cover Bridge Color-coding Treewidth Neighbourhood Covering graph Incidence coloring
245	Spectral Graph Theory Lecture 4 Bounding Eigenvalues Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2015-08-17 14:43:26 Expander graph Graph coloring Min-max theorem Incidence coloring
246	Monochromatic triangles in two-colored plane V´ıt Jel´ınek Jan Kynˇcl Rudolf Stolaˇr ´ s Valla Tomaˇ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2007-02-02 08:52:54 Graph coloring NP-complete problems Monochromatic triangle E2
247	An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2009-06-04 05:35:50 NP-complete problems Functional analysis Vertex cover Distribution Graph coloring Dominating set Maximal independent set
248	Name: _______________ Writing Page Coloring Page Add to Reading List Source URL: www.progressivephonics.com - Date: 2016-02-10 16:54:57
249	c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16. DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2004-03-11 06:32:34 Graph coloring Polynomials Complexity classes Matroid theory Tutte polynomial Chromatic polynomial K-edge-connected graph Matroid Expander graph NC
250	Two Layer 3D Floor Planning Paul Horn∗ Gabor Lippner∗ October 16, 2012 Add to Reading List Source URL: web.cs.du.edu Language: English - Date: 2012-10-16 21:07:17 Tree Vertex Graph connectivity Graph operations Graph coloring NP-complete problems Pathwidth

UPDATE