117 search results - page 11 / 24 » Graphs with Chromatic Roots in the Interval (1, 2) |
61
Voted
COMBINATORICS
1999
15 years 2 days ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
123
Voted
TCS
2010
14 years 10 months ago
2010
: We study a variant of the path cover problem, namely, the k-fixed-endpoint path cover problem, or kPC for short. Given a graph G and a subset T of k vertices of V (G), a k-fixe...
102
click to vote
ESA
2000
Springer
15 years 4 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
73
Voted
COMBINATORICS
2007
15 years 12 days ago
2007
The distinguishing number ∆(X) of a graph X is the least positive integer n for which there exists a function f : V (X) → {0, 1, 2, · · · , n−1} such that no nonidentity ...
103
click to vote
COCOA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...