1749 search results - page 142 / 350 » Conditional colorings of graphs |
161
click to vote
WACV
2008
IEEE
16 years 29 days ago
2008
IEEE
A 2D color barcode can hold much more information than a binary barcode. Barcodes are often intended for consumer use, such as, a consumer can take an image with her cellphone cam...
129
click to vote
EJC
2006
15 years 6 months ago
2006
A class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphism to H. We give a general necessary and sufficient condition for the existence of boun...
141
click to vote
EJC
2007
15 years 6 months ago
2007
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new...
168
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
We prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical. 1...
171
click to vote
CPC
2006
15 years 6 months ago
2006
We observe returns of a simple random walk on a finite graph to a fixed node, and would like to infer properties of the graph, in particular properties of the spectrum of the trans...