Title of article :
Colorings of diagrams of interval orders and α-sequences of sets Original Research Article
Author/Authors :
Stefan Felsner، نويسنده , , William T. Trotter، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1995
Pages :
9
From page :
23
To page :
31
Abstract :
We show that a proper coloring of the diagram of an interval order I may require 1 + ⌈log2 height(I)⌉ colors and that 2 + ⌈log2 height(I)⌉ colors always suffice. For the proof of the upper bound we use the following fact: A sequence C1, …, Ch of sets (of colors) with the property Cj⊈Ci-1∪Ci for all 1
Keywords :
diagram , Boolean lattice , Hamiltonian path , Chromatic number , Interval order
Journal title :
Discrete Mathematics
Serial Year :
1995
Journal title :
Discrete Mathematics
Record number :
943634
Link To Document :
