63 search results - page 2 / 13 » Distance graphs with maximum chromatic number |
EJC
2000
13 years 5 months ago
2000
JGT
2008
13 years 5 months ago
2008
An edge-operation on a graph G is defined to be either the deletion of an existing edge or the addition of a nonexisting edge. Given a family of graphs G, the editing distance fro...
GC
2008
Springer
13 years 5 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
JGT
2007
13 years 5 months ago
2007
EJC
2008
13 years 5 months ago
2008
Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z, D), has the set Z of all integers as the vertex Supported in part by the National Science ...