Sciweavers

720 search results - page 53 / 144
» Nonrepetitive colorings of graphs
Sort
View
IPL
2008
89views more  IPL 2008»
13 years 7 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik
SIAMDM
2008
154views more  SIAMDM 2008»
13 years 7 months ago
On the First-Fit Chromatic Number of Graphs
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
József Balogh, Stephen G. Hartke, Qi Liu, G...
MICCAI
2006
Springer
14 years 8 months ago
Cell Segmentation Using Coupled Level Sets and Graph-Vertex Coloring
Sumit Kumar Nath, Kannappan Palaniappan, Filiz Bun...
CPM
2009
Springer
93views Combinatorics» more  CPM 2009»
14 years 2 months ago
Maximum Motif Problem in Vertex-Colored Graphs
Riccardo Dondi, Guillaume Fertin, Stéphane ...