Sciweavers

DM
2007
100views more  DM 2007»
13 years 11 months ago
Improved bounds on acyclic edge colouring
We prove that the acyclic chromatic index a (G) 6 for all graphs with girth at least 9. We extend the same method to obtain a bound of 4.52 with the girth requirement g 220. We al...
Rahul Muthu, N. Narayanan, C. R. Subramanian
DM
2007
114views more  DM 2007»
13 years 11 months ago
An inequality for the group chromatic number of a graph
—We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality...
Hong-Jian Lai, Xiangwen Li, Gexin Yu
CPC
2007
88views more  CPC 2007»
13 years 11 months ago
Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs
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...
Bill Jackson
DM
2010
78views more  DM 2010»
13 years 11 months ago
Injective colorings of sparse graphs
Let Mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if Mad(G) 5 2 , then i(G) + 1; sim...
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
CORR
2010
Springer
92views Education» more  CORR 2010»
13 years 11 months ago
On Packing Colorings of Distance Graphs
The packing chromatic number (G) of a graph G is the least integer k for which there exists a mapping f from V (G) to {1, 2, . . ., k} such that any two vertices of color i
Olivier Togni
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 11 months ago
Injective colorings of graphs with low average degree
Let mad(G) denote the maximum average degree (over all subgraphs) of G and let i(G) denote the injective chromatic number of G. We prove that if 4 and mad(G) < 14 5 , then i(G...
Daniel W. Cranston, Seog-Jin Kim, Gexin Yu
IJCAI
1989
14 years 19 days ago
Chromatic Stereopsis
It is well known that chromatic information can assist in solving the stereo correspondence problem. It has also been suggested that there are two independent first-order stereop...
John R. Jordan III, Alan C. Bovik, Wilson S. Geisl...