Bipartable graphs
We consider a construction which associates with a graph G another graph G' such that if G' is a bipartite graph, G is perfectly orderable. For such a graph G we give a polynomial algorithm for an optimal coloring by delivering a perfect order on his nodes. This class of graphs is shown to be different from the known classes of perfectly orderable graphs.
scientific article; zbMATH DE number 3966127
scientific article