Results 1  10
of
61
On the minimum degree of minimal Ramsey graphs for multiple colours
"... Abstract A graph G is rRamsey for a graph H, denoted by G → (H) r , if every rcolouring of the edges of G contains a monochromatic copy of H. The graph G is called rRamseyminimal for H if it is rRamsey for H but no proper subgraph of G possesses this property. Let s r (H) denote the smallest mi ..."
Abstract
 Add to MetaCart
Abstract A graph G is rRamsey for a graph H, denoted by G → (H) r , if every rcolouring of the edges of G contains a monochromatic copy of H. The graph G is called rRamseyminimal for H if it is rRamsey for H but no proper subgraph of G possesses this property. Let s r (H) denote the smallest
Graph homomorphisms, circular colouring, and fractional covering by hcuts
"... A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. The instances of the Weighted Maximum HColourable Subgraph problem (MAX HCOL) are edgeweighted graphs G and the objective is to find a subgraph of G that has maximal total edge weight, under t ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. The instances of the Weighted Maximum HColourable Subgraph problem (MAX HCOL) are edgeweighted graphs G and the objective is to find a subgraph of G that has maximal total edge weight, under
ON THE BOUNDED DEGREE RESTRICTION OF CONSTRAINT SATISFACTION PROBLEMS
"... Given a graph H, let b(H) be the minimum integer b, if it exists, for which Hcolouring is NPcomplete when restricted to instances with degree bounded by b. We show for any loopless nonbipartite graphs H that b(H) is bounded above by a function of the size of H. Futhermore, we get tight upper bou ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Given a graph H, let b(H) be the minimum integer b, if it exists, for which Hcolouring is NPcomplete when restricted to instances with degree bounded by b. We show for any loopless nonbipartite graphs H that b(H) is bounded above by a function of the size of H. Futhermore, we get tight upper
Geometric Constraint Decomposition
"... We present a flowbased method for decomposing the graph of a geometric constraint problem. The method fully generalizes degreeoffreedom calculations, prior approaches based on matching specific subgraph patterns, as well as prior flowbased approaches. Moreover, the method generically iterates to ..."
Abstract

Cited by 9 (8 self)
 Add to MetaCart
We present a flowbased method for decomposing the graph of a geometric constraint problem. The method fully generalizes degreeoffreedom calculations, prior approaches based on matching specific subgraph patterns, as well as prior flowbased approaches. Moreover, the method generically iterates
A computational analysis of colour constancy
 Oxford University
, 2003
"... 2 The visual stimulus associated with an object surface varies with the illumination falling on the object. Constancy of perceived surface colour under changing illumination implies that the illuminationdependent mapping from surface reflectance to stimulus is cancelled by a compensatory variation ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
2 The visual stimulus associated with an object surface varies with the illumination falling on the object. Constancy of perceived surface colour under changing illumination implies that the illuminationdependent mapping from surface reflectance to stimulus is cancelled by a compensatory
What About the Chromatic Zeros of a Signed Graph?
"... A signed graph Σ is a graph Σ  with a sign function on the edges, σ: E → {+, −}. A (simple) cycle is called positive or negative depending on the product of its edge signs, and Σ is balanced if every cycle is positive; for instance, when all edges are positive. To (properly) kcolour a signed grap ..."
Abstract
 Add to MetaCart
A signed graph Σ is a graph Σ  with a sign function on the edges, σ: E → {+, −}. A (simple) cycle is called positive or negative depending on the product of its edge signs, and Σ is balanced if every cycle is positive; for instance, when all edges are positive. To (properly) kcolour a signed
Previous Up Next Article Citations From References: 1 From Reviews: 0
"... Local edge colouring of Yaolike subgraphs of unit disk graphs. (English summary) Theoret. Comput. Sci. 410 (2009), no. 14, 1388–1400. Summary: “The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yaolike subgraphs of Unit Disk Graphs. These are ..."
Abstract
 Add to MetaCart
Local edge colouring of Yaolike subgraphs of unit disk graphs. (English summary) Theoret. Comput. Sci. 410 (2009), no. 14, 1388–1400. Summary: “The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yaolike subgraphs of Unit Disk Graphs
under a Creative Commons Attribution NonCommercial No Derivatives
, 2013
"... the condition that they attribute it, that they do not use it for commercial purposes and that they do not alter, transform or build upon it. For any reuse or redistribution, researchers must make clear to others the licence terms of this work. ..."
Abstract
 Add to MetaCart
the condition that they attribute it, that they do not use it for commercial purposes and that they do not alter, transform or build upon it. For any reuse or redistribution, researchers must make clear to others the licence terms of this work.
3esis Supervisor Accepted by
, 2005
"... in partial ful2llment of the requirements for the degree of ..."
Results 1  10
of
61