On powers of \(m\)-trapezoid graphs
From MaRDI portal
Publication:1902905
DOI10.1016/0166-218X(95)00062-VzbMath0839.05091MaRDI QIDQ1902905
Publication date: 3 December 1995
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
An efficient algorithm to solve the distancek-domination problem on permutation graphs ⋮ Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems ⋮ Duchet-type theorems for powers of HHD-free graphs ⋮ On powers of circular arc graphs and proper circular arc graphs ⋮ Unnamed Item ⋮ Distance-\(d\) independent set problems for bipartite and chordal graphs ⋮ Powers of geometric intersection graphs and dispersion algorithms ⋮ Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs ⋮ Graphs whose complement and square are isomorphic ⋮ Approximation of RNA multiple structural alignment ⋮ A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs ⋮ How to use the minimal separators of a graph for its chordal triangulation ⋮ A characterization of interval orders with semiorder dimension two ⋮ The hub number of co-comparability graphs ⋮ Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs ⋮ Mim-width. III. Graph powers and generalized distance domination problems ⋮ Computing the \(K\)-terminal reliability of directed path graphs
Cites Work
