244 search results - page 10 / 49 » Intervalizing k-Colored Graphs |
131
Voted
SODA
2003
ACM
15 years 3 months ago
2003
ACM
JCT
2008
15 years 2 months ago
2008
134
click to vote
IWOCA
2010
Springer
14 years 9 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
102
click to vote
IPL
1998
15 years 2 months ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
129
click to vote
JCT
2007
15 years 2 months ago
2007
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. D.R. Woodall has shown that, if G is a plane triangulation, then the only zeros of P(G,t) in (−∞...