The following pages link to (Q3783331):
Displayed 20 items.
- A linear time algorithm to compute square of interval graphs and their colouring (Q322053) (← links)
- Max point-tolerance graphs (Q344833) (← links)
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- Distances in cocomparability graphs and their powers (Q1183347) (← links)
- Duchet-type theorems for powers of HHD-free graphs (Q1377865) (← links)
- Powers of geometric intersection graphs and dispersion algorithms (Q1414578) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Powers of distance-hereditary graphs (Q1901030) (← links)
- On powers of \(m\)-trapezoid graphs (Q1902905) (← links)
- On powers of circular arc graphs and proper circular arc graphs (Q1923580) (← links)
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q2111523) (← links)
- Edge ideals of squares of trees (Q2134245) (← links)
- Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← links)
- Distance-\(d\) independent set problems for bipartite and chordal graphs (Q2436655) (← links)
- Graphs whose complement and square are isomorphic (Q2449164) (← links)
- Structural properties of word representable graphs (Q2630778) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q6167020) (← links)