Abstract :

Cover graphs and Comparability graphs are two well known graphs from posets. Characterization of cover graphs is still not known while comparability graphs have nice characterizations and also they can be recognized in polynomial time. Here a new class of graphs from posets is introduced and some basic results and some problems on these graphs is presented.