117 search results - page 7 / 24 » Graphs with Chromatic Roots in the Interval (1, 2) |
TCS
2008
13 years 7 months 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...
ICALP
2011
Springer
12 years 10 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...
IPL
1998
13 years 7 months 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...
MOC
1998
13 years 7 months 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 ...
WG
2004
Springer
14 years 21 days 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...