
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.
chordal bipartite graph, Theoretical Computer Science, Chordal graph, chordal graph, Coloring of graphs and hypergraphs, vertex separator, Coloring, Discrete Mathematics and Combinatorics, Vertex separator, Chordal bipartite graph, Structural characterization of families of graphs, coloring
chordal bipartite graph, Theoretical Computer Science, Chordal graph, chordal graph, Coloring of graphs and hypergraphs, vertex separator, Coloring, Discrete Mathematics and Combinatorics, Vertex separator, Chordal bipartite graph, Structural characterization of families of graphs, coloring
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
