Erratum to the paper "Uniquely edge colourable graph"
Estimation of cut-vertices in edge-coloured complete graphs
Evaluating a weighted graph polynomial for graphs of bounded tree-width.
Existence and nonexistence of universal graphs
Exploiting the structure of conflict graphs in high level synthesis
In this paper we analyze the computational complexity of a processor optimization problem. Given operations with interval times in a branching flow graph, the problem is to find an assignment of the operations to a minimum number of processors. We analyze the complexity of this assignment problem for flow graphs with a constant number of program traces and a constant number of processors.
Extending Hall's theorem into list colorings: a partial history.
Extremal Crossing Numbers of Complete -Chromatic Graphs
Extremal problems for -partite and -colorable hypergraphs.
Extremal Properties of the Chromatic Polynomials of Connected 3-chromatic Graphs
Extreme distances in multicolored point sets.