Related Searches
Definitions
Vertex_colouring

Vertex_colouring

Vertex colouring
See Graph coloring
Wikipedia, the free encyclopedia © 2001-2006 Wikipedia contributors (Disclaimer)
This article is licensed under the GNU Free Documentation License.
Last updated on Wednesday February 01, 2006 at 14:19:11 PST (GMT -0800)
View this article at Wikipedia.org - Edit this article at Wikipedia.org - Donate to the Wikimedia Foundation

Related Articles
Vertex-colouring edge-weightings with two edge weights.(Report)
Apr 18, 2012; 1 Introduction Let G be a simple graph and S be a set of real numbers. An S-edge-weighting of G is an assignment w : E(G) [right...
Read more with a free trial on HighBeam.com »
Sequence Variations of the 1-2-3 Conjecture and Irregularity Strength
Jan 01, 2013; 1 Introduction and Brief Survey A graph G = (V, E) will be simple and loopless unless otherwise stated. Throughout, we write [k]...
Read more with a free trial on HighBeam.com »
Studies from Masaryk University update current data on operations science.
Sep 28, 2010; "For many problems in scheduling and timetabling, the choice of a mathematical programming formulation is determined by the...
Read more with a free trial on HighBeam.com »
Data on Combinatorics Detailed by M. Khatirinejad and Co-Authors.
Apr 18, 2011; "An edge-weighting vertex colouring of a graph is an edge-weight assignment such that the accumulated weights at the vertices...
Read more with a free trial on HighBeam.com »
On a 1,2 conjecture.(Report)
Jan 01, 2010; 1 Introduction A k-total-weighting of a simple graph G is an assignment of an integer weight, w(e), w(v) [member of] {1, k} to...
Read more with a free trial on HighBeam.com »
HighBeam Research, Inc. © Copyright 2009.

Search another word or see Vertex_colouringon Dictionary | Thesaurus |Spanish
  • Please Login or Sign Up to use the Recent Searches feature
FAVORITES
RECENT