On Powers of Chordal Graphs And Their Colorings

By G. Agnarsson, R. Greenlaw, M. Halldórsson. 2000

53 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/e901e03d4522510a51282d4a23a54b2564672998

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Assefaw Hadish Gebremedhin
2. Alex Pothen
3. Fredrik Manne
4. Jok Man Tang
5. Joel A. E. Andersson

Citations in the corpus

• What Color Is Your Jacobian? Graph Coloring for Computing Derivatives (2005, background): “Agnarsson, Greenlaw, and Halldórsson [2] studied distance-k coloring of chordal graphs and showed that for even integers k, the problem is not approximable within a factor of |V |1/2− for any > 0.”