The following pages link to Derek G. Corneil (Q1070246):
Displaying 50 items.
- Embedding Trees in a Hypercube is NP-Complete (Q3476279) (← links)
- A note onKi-perfect graphs (Q3490043) (← links)
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations (Q3521955) (← links)
- An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs (Q3590946) (← links)
- A Unified View of Graph Searching (Q3648497) (← links)
- A Simple Linear Time LexBFS Cograph Recognition Algorithm (Q3648499) (← links)
- (Q3663341) (← links)
- (Q3697033) (← links)
- On generalized graph colorings (Q3748295) (← links)
- Complexity of Finding Embeddings in a <i>k</i>-Tree (Q3751595) (← links)
- Families of graphs complete for the strong perfect graph Conjecture (Q3760583) (← links)
- A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees (Q3773922) (← links)
- (Q3797233) (← links)
- A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem (Q3897079) (← links)
- (Q3910555) (← links)
- (Q3952124) (← links)
- Graph Property Update Algorithms and Their Appligation to Distance Matrices (Q3967059) (← links)
- Isomorphism Testing in Hookup Classes (Q3968949) (← links)
- ON UNIQUELY -G k-COLOURABLE GRAPHS (Q4034558) (← links)
- (Q4063169) (← links)
- Unicyclic Graphs Satisfy Harary′s Conjecture (Q4068760) (← links)
- (Q4090344) (← links)
- (Q4107927) (← links)
- (Q4121908) (← links)
- Parallel Computations in Graph Theory (Q4154064) (← links)
- The graph isomorphism disease (Q4159083) (← links)
- Algorithmic Techniques for the Generation and Analysis of Strongly Regular Graphs and other Combinatorial Configurations (Q4182792) (← links)
- (Q4190142) (← links)
- Tree Powers (Q4217303) (← links)
- (Q4232788) (← links)
- (Q4250178) (← links)
- (Q4252390) (← links)
- Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs (Q4268709) (← links)
- Asteroidal Triple-Free Graphs (Q4377431) (← links)
- On the power of BFS to determine a graph's diameter (Q4446912) (← links)
- (Q4448749) (← links)
- (Q4448763) (← links)
- (Q4508369) (← links)
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs (Q4645186) (← links)
- Recognizing Powers of Proper Interval, Split, and Chordal Graphs (Q4652622) (← links)
- Tree Spanners (Q4847362) (← links)
- A generalization of line graphs: (X, Y)-intersection graphs (Q4875681) (← links)
- A generalization of perfect graphs?i-perfect graphs (Q4892347) (← links)
- A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs (Q4899036) (← links)
- Corrigendum: LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs (Q4997325) (← links)
- Computing a dominating pair in an asteroidal triple-free graph in linear time (Q5057448) (← links)
- Collective Tree Spanners and Routing in AT-free Related Graphs (Q5301383) (← links)
- Additive Spanners for Circle Graphs and Polygonal Graphs (Q5302048) (← links)
- On the Relationship Between Clique-Width and Treewidth (Q5317177) (← links)
- Linear Orderings of Subfamilies of AT‐Free Graphs (Q5470820) (← links)
