On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
DOI10.1016/j.jda.2014.11.004zbMath1320.05125arXiv1110.3583OpenAlexW2027749549WikidataQ62041737 ScholiaQ62041737MaRDI QIDQ2253902
Yue-Li Wang, Chin-Ting Ung, Sheung-Hung Poon, Ton Kloks
Publication date: 13 February 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1110.3583
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hypergraphs with no special cycles
- Trapezoid graphs and generalizations, geometry and algorithms
- On rigid circuit graphs
- Weakly triangulated graphs
- The strong perfect graph theorem
- Maximum induced matchings for chordal graphs in linear time
- Characterizations of strongly chordal graphs
- A characterization of totally balanced hypergraphs
- Bipartite permutation graphs
- Trapezoid graphs and their coloring
- Strong tree-cographs are Birkhoff graphs
- NP-completeness of some generalizations of the maximum matching problem
- Induced matchings
- Treewidth. Computations and approximations
- Induced matchings in asteroidal triple-free graphs
- Induced matchings in intersection graphs.
- On the computational complexity of strong edge coloring
- Finding a maximum induced matching in weakly chordal graphs
- Algorithmic graph theory and perfect graphs
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees
- A min-max property of chordal bipartite graphs with applications
- Representation characterizations of chordal bipartite graphs
- Improved algorithms for weakly chordal graphs
- Representation of a finite graph by a set of intervals on the real line
- Characterizations of totally balanced matrices
- Three Partition Refinement Algorithms
- A Characterization of Block-Graphs
- A characterization of ptolemaic graphs
- Computing the Minimum Fill-In is NP-Complete
- Algorithmic Aspects of Vertex Elimination on Graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Treewidth and Minimum Fill-in on d-Trapezoid Graphs
- Characterizations of derived graphs
- Difference graphs
This page was built for publication: On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
