Chordal multipartite graphs and chordal colorings (Q2643326): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.11.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083834444 / rank | |||
Normal rank | |||
Revision as of 03:06, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Chordal multipartite graphs and chordal colorings |
scientific article |
Statements
Chordal multipartite graphs and chordal colorings (English)
0 references
23 August 2007
0 references
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.
0 references
chordal graph
0 references
vertex separator
0 references
chordal bipartite graph
0 references
coloring
0 references
