Chordal multipartite graphs and chordal colorings (Q2643326): Difference between revisions

A graph is defined to be chordal colorable if it admits a proper vertex-coloring such that each minimal separator induces a subgraph in which two vertices are adjacent if and only if they are differently colored. All chordal graphs and all chordal bipartite graphs are chordal colorable. All chordal colorable graphs are weakly chordal. The class of chordal colorable graphs is characterised, amongst others, by minimal forbidden subgraphs.