Search
Now showing items 1-1 of 1
On the perfect orderability of unions of two graphs
(1996)
A graph G is perfectly orderable if it admits an order < on its vertices such that the
sequential coloring algorithm delivers an optimum coloring on each induced subgraph
(H, <) of (G, <). A graph is a threshold graph ...