25 search results - page 1 / 5 » Algebraic characterization of uniquely vertex colorable grap... |
JCT
2008
13 years 7 months ago
2008
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
DM
1999
13 years 7 months ago
1999
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We de...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
DAM
2002
13 years 7 months ago
2002
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
WAOA
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...