Browsing by Subject "Perfect graphs"

Now showing items 1-2 of 2

    • On the perfect orderability of unions of two graphs 

      Tu, Xiaodan (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 ...

    • Results on perfect graphs 

      Petrick, Mark David Timothy (2000)
      The chromatic number of a graph G is the least number of colours that can be assigned to the vertices of G such that two adjacent vertices are assigned different colours. The clique number of a graph G is the size of the ...