Chordal multipartite graphs and chordal colorings
From MaRDI portal
(Redirected from Publication:2643326)
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.
Recommendations
Cites work
- Algorithmic graph theory and perfect graphs
- Graph Classes: A Survey
- scientific article; zbMATH DE number 1194938 (Why is no real title available?)
- On the coloring of signed graphs
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Requiring chords in cycles
- Topics in Intersection Graph Theory
- Weakly triangulated graphs
Cited in
(5)
This page was built for publication: Chordal multipartite graphs and chordal colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643326)