1749 search results - page 50 / 350 » Conditional colorings of graphs |
156
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
A parity walk in an edge-coloring of a graph is a walk along which each color is used an even number of times. Let p(G) be the least number of colors in an edge-coloring of G havi...
133
click to vote
DATE
1998
IEEE
15 years 10 months ago
1998
IEEE
We present an approach to process scheduling based on an abstract graph representation which captures both dataflow and the flow of control. Target architectures consist of severa...
146
click to vote
ARSCOM
2004
15 years 6 months ago
2004
We show that in any graph G on n vertices with d(x) + d(y) n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian c...
162
click to vote
ICIP
2010
IEEE
15 years 4 months ago
2010
IEEE
We propose a novel method to synthesize intermediate views from two stereo images and disparity maps that is robust to errors in disparity map. The proposed method computes a plac...
164
click to vote
ENDM
2008
15 years 6 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...