45 search results - page 1 / 9 » Connectedness of the graph of vertex-colourings |
Book
A well-written book about graph theory.
Book
A classic book on graph theory.
EMNLP
2010
13 years 2 months ago
2010
Linguistic Steganography is concerned with hiding information in natural language text. One of the major transformations used in Linguistic Steganography is synonym substitution. ...
COLOGNETWENTE
2009
13 years 5 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
CORR
2004
Springer
13 years 4 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...