123
Voted
COLOGNETWENTE
2009
15 years 3 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...
314
Voted
Book
A well-written book about graph theory.
