On the strong chromatic index and induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
classification
🧮 math.CO
keywords
graphsbipartitechromaticindexstrongalgorithmschordalexist
read the original abstract
We show that there exist linear-time algorithms that compute the strong chromatic index and a maximum induced matching of tree-cographs when the decomposition tree is a part of the input. We also show that there exist efficient algorithms for the strong chromatic index of (bipartite) permutation graphs and of chordal bipartite graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.