The following pages link to Derek Gordon Corneil (Q1070246):
Displaying 14 items.
- 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)
- Algorithms for finding a fundamental set of cycles for an undirected linear graph (Q5541597) (← links)
- An Efficient Algorithm for Graph Isomorphism (Q5597464) (← links)
- An algorithm for determining the automorphism partitioning of an undirected graph (Q5645023) (← links)
- Corrections to Bierstone's Algorithm for Generating Cliques (Q5660481) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710792) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710823) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897552) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902515) (← links)
- Stable 2-pairs and \((X,Y)\)-intersection graphs (Q5931414) (← links)
- Diameter determination on restricted graph families (Q5951960) (← links)
- Maximal Cliques Lattices Structures for Cocomparability Graphs with Algorithmic Applications (Q6493757) (← links)
