![Graph theory / Graph coloring / Matching / NP-complete problems / Combinatorial optimization / Graph operations / Blossom algorithm / Bipartite graph / Chordal graph / Complete coloring / Cograph / Ear decomposition Graph theory / Graph coloring / Matching / NP-complete problems / Combinatorial optimization / Graph operations / Blossom algorithm / Bipartite graph / Chordal graph / Complete coloring / Cograph / Ear decomposition](https://www.pdfsearch.io/img/301917bdfcdd8da975e9e9bd5392004b.jpg) Date: 2014-02-09 09:55:11Graph theory Graph coloring Matching NP-complete problems Combinatorial optimization Graph operations Blossom algorithm Bipartite graph Chordal graph Complete coloring Cograph Ear decomposition | | b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1Add to Reading ListSource URL: www.zaik.uni-koeln.deDownload Document from Source Website File Size: 308,41 KBShare Document on Facebook
|