128
Voted
COLOGNETWENTE
15 years 3 months ago
2009 
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
117
click to vote
COLOGNETWENTE
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...
111
Voted
COLOGNETWENTE
15 years 3 months ago
2009  83
Voted
COLOGNETWENTE
15 years 3 months ago
2009 114
Voted
COLOGNETWENTE
15 years 3 months ago
2009 
: Weakly quasi-threshold graphs form a proper subclass of the well-known class of cographs by restricting the join operation. In this paper we characterize weakly quasi-threshold g...
|
Optimization