Chordal multipartite graphs and chordal colorings (Q2643326): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4208001 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph Classes: A Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the coloring of signed graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic graph theory and perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Weakly triangulated graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Requiring chords in cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Topics in Intersection Graph Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognizing interval digraphs and interval bigraphs in polynomial time / rank | |||
Normal rank |
Latest revision as of 14:09, 26 June 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