7 search results - page 1 / 2 » Chromatically Unique Multibridge Graphs |
COMBINATORICS
2004
13 years 4 months ago
2004
Let (a1, a2,
DM
2002
13 years 4 months ago
2002
For a graph G, let P(G; ) be its chromatic polynomial and let [G] be the set of graphs having P(G; ) as their chromatic polynomial. We call [G] the chromatic equivalence class of ...
DM
2000
13 years 4 months ago
2000
For integers p; q; s with p
DAM
2002
13 years 4 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...
ICALP
2011
Springer
12 years 8 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 ...