activity
19982007
most citedParity Edge-Coloring of Graphs

4 citations · 4 across the 2 of their papers we have counts for

collaborators
Showing 1998 · math.COShow all

9 papers · 2 filters

math.CO1998

A short proof that ``proper = unit''

Kenneth P. Bogart, Douglas B. West

A short proof is given that the graphs with proper interval representations are the same as the graphs with unit interval representations.

math.CO1998

Intersection representation of digraphs in trees with few leaves

In-Jen Lin, Malay K. Sen, Douglas B. West

The leafage of a digraph is the minimum number of leaves in a host tree in which it has a subtree intersection representation. We discuss bounds on the leafage in terms of other pa…

math.CO1998

A note on generalized chromatic number and generalized girth

Béla Bollobás, Douglas B. West

Erdős proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers.

math.CO1998

Realizing degree imbalances in directed graphs

Dhruv Mubayi, Todd G. Will, Douglas B. West

In a directed graph, the imbalance of a vertex is its outdegree minus its indegree. We characterize the sequences that are realizable as the sequence of imbalances of a simple dire…

math.CO1998

The leafage of a chordal graph

In-Jen Lin, Terry A. McKee, Douglas B. West

The leafage l(G) of a chordal graph G is the minimum number of leaves of a tree in which G has an intersection representation by subtrees. We obtain upper and lower bounds on l(G)…

math.CO1998

Star-factors of tournaments

Guantao Chen, Xiaoyun Lu, Douglas B. West

Let S_m denote the m-vertex simple digraph formed by m-1 edges with a common tail. Let f(m) denote the minimum n such that every n-vertex tournament has a spanning subgraph consist…