244 search results - page 13 / 49 » Intervalizing k-Colored Graphs |
134
click to vote
CPC
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. G.D. Birkhoff and D.C. Lewis showed that, if G is a plane near triangulation, then the only zeros of...
135
click to vote
JGT
2010
15 years 29 days ago
2010
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
147
Voted
TVCG
2012
13 years 5 months ago
2012
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
107
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...
124
click to vote
DAM
2010
15 years 2 months ago
2010
A dynamic coloring of a graph is a proper coloring of its vertices such that every vertex of degree more than one has at least two neighbors with distinct colors. The least number...