• Corpus ID: 119320184

On the strong chromatic index and induced matching of tree-cographs, permutation graphs and chordal bipartite graphs

@article{Kloks2011OnTS,
  title={On the strong chromatic index and induced matching of tree-cographs, permutation graphs and chordal bipartite graphs},
  author={Ton Kloks and Chin-Ting Ung and Yue-Li Wang},
  journal={arXiv: Combinatorics},
  year={2011}
}
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. 

Figures from this paper

References

SHOWING 1-10 OF 42 REFERENCES

Perfect Elimination and Chordal Bipartite Graphs

TLDR
This work removes the constraint imposed by Haskins and Rose that pivots must be along the main diagonal and proves theorems analogous to those of Dirac and Rose for chordal graphs.

A Min–Max Property of Chordal Bipartite Graphs with Applications

TLDR
It is established that for a chordal bipartite graph G, the minimum number of chain subgraphs of G needed to cover E(G) equals the size of a largest induced matching in G, and also that a minimum chain sub graph cover can be computed in polynomial time.

On the computational complexity of strong edge coloring

Trapezoid graphs and their coloring

Finding a maximum induced matching in weakly chordal graphs

Bipartite permutation graphs

Feedback vertex set on chordal bipartite graphs

Let G=(A,B,E) be a bipartite graph with color classes A and B. The graph G is chordal bipartite if G has no induced cycle of length more than four. Let G=(V,E) be a graph. A feedback vertex set F is

A characterization of totally balanced hypergraphs

Characterizations of strongly chordal graphs