#### Filter Results:

#### Publication Year

1982

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

Let G be a graph. The core of G, denoted by G ∆ , is the subgraph of G induced by the vertices of degree ∆(G), where ∆(G) denotes the maximum degree of G. A k-edge coloring of G is a function f : E(G) → L such that |L| = k and f (e 1) = f (e 2) for all two adjacent edges e 1 and e 2 of G. The chromatic index of G, denoted by χ (G), is the minimum number k… (More)

The tree partition number of an r-edge-colored graph G, denoted by t r (G), is the minimum number k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. We determine t 2 (K(n 1 , n 2 ,. .. , n k)) of the complete k-partite graph K(n 1 , n 2 ,. .. , n k). In… (More)

Given n red and n blue points in the plane and a planar straight line matching between the red and the blue points, the matching can be extended into a bipartite planar straight line spanning tree. That is, any red-blue planar matching can be completed into a crossing-free red-blue spanning tree. Such a tree can be constructed in O(n log n) time.

Let X be a set of multicolored points in the plane such that no three points are collinear and each color appears on at most ⌈|X|/2⌉ points. We show the existence of a non-crossing properly colored geometric perfect matching on X (if |X| is even), and the existence of a non-crossing properly colored geometric spanning tree with maximum degree at most 3 on… (More)

Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that sees an entire edge in another component. This implies that when the vertices of G are colored, so that adjacent vertices have different colors, then (1) we can augment G with k − 1… (More)