The following pages link to Lorna K. Stewart (Q1060965):
Displaying 48 items.
- (Q287165) (redirect page) (← links)
- Total domination and transformation (Q287166) (← links)
- On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two (Q626859) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- Independence and domination in polygon graphs (Q686246) (← links)
- Games on interval and permutation graph representations (Q897865) (← links)
- Finding minimum dominating cycles in permutation graphs (Q1060966) (← links)
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
- Bipartite permutation graphs (Q1092931) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) (← links)
- On cocolourings and cochromatic numbers of graphs (Q1315460) (← links)
- Recursively decomposable well-covered graphs (Q1356429) (← links)
- Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) (← links)
- Biconvex graphs: Ordering and algorithms (Q1570816) (← links)
- Subtree filament graphs are subtree overlap graphs (Q2380028) (← links)
- On polygon numbers of circle graphs and distance hereditary graphs (Q2413962) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- (Q2741348) (← links)
- Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph (Q2852152) (← links)
- The Mycielskian of a Graph (Q2865727) (← links)
- The LBFS Structure and Recognition of Interval Graphs (Q3058537) (← links)
- Domination on Cocomparability Graphs (Q3136612) (← links)
- DP-Complete Problems Derived from Extremal NP-Complete Properties (Q3182925) (← links)
- (Q3684150) (← links)
- (Q3789614) (← links)
- (Q3797239) (← links)
- (Q3800068) (← links)
- Complexity results for well‐covered graphs (Q3993632) (← links)
- (Q4250178) (← links)
- (Q4251056) (← links)
- (Q4252390) (← links)
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs (Q4268709) (← links)
- (Q4301896) (← links)
- Polygon Graph Recognition (Q4377123) (← links)
- Asteroidal Triple-Free Graphs (Q4377431) (← links)
- (Q4448763) (← links)
- (Q4558964) (← links)
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Q4645186) (← links)
- Approximating Bandwidth by Mixing Layouts of Interval Graphs (Q4785694) (← links)
- Computing a dominating pair in an asteroidal triple-free graph in linear time (Q5057448) (← links)
- On List Coloring and List Homomorphism of Permutation and Interval Graphs (Q5246080) (← links)
- (Q5284020) (← links)
- Finite element modelling of fibre reinforced polymer sandwich panels exposed to heat (Q5311945) (← links)
- (Q5387655) (← links)
- (Q5387691) (← links)
- Linear Orderings of Subfamilies of AT‐Free Graphs (Q5470820) (← links)
