117 search results - page 7 / 24 » Graphs with Chromatic Roots in the Interval (1, 2) |
91
Voted
TCS
2008
15 years 9 days ago
2008
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...
114
Voted
ICALP
2011
Springer
14 years 3 months ago
2011
Springer
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
89
Voted
IPL
1998
15 years 2 days ago
1998
An equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most one. The least positive integer k for which there exis...
87
Voted
MOC
1998
15 years 2 days ago
1998
Given a monic real polynomial with all its roots on the unit circle, we ask to what extent one can perturb its middle coefficient and still have a polynomial with all its roots on ...
81
Voted
WG
2004
Springer
15 years 5 months ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...