The following pages link to Derek Gordon Corneil (Q1070246):
Displaying 50 items.
- (Q221664) (redirect page) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Collective additive tree spanners for circle graphs and polygonal graphs (Q444436) (← links)
- Practical and efficient circle graph recognition (Q472484) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- A linear time algorithm to compute a dominating path in an AT-free graph (Q673002) (← links)
- On pseudosimilarity in trees (Q791542) (← links)
- A tie-break model for graph search (Q896657) (← links)
- The complexity of regular subgraph recognition (Q912615) (← links)
- Forbidden minors characterization of partial 3-trees (Q913807) (← links)
- On end-vertices of lexicographic breadth first searches (Q968161) (← links)
- A note on a conjecture by Gavril on clique separable graphs (Q1050357) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- The complexity of generalized clique packing (Q1073049) (← links)
- On deciding switching equivalence of graphs (Q1141663) (← links)
- Complement reducible graphs (Q1153105) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- Addendum to: The complexity of regular subgraph recognition (Q1175798) (← links)
- Graph properties and hypergraph colourings (Q1184854) (← links)
- On cycle double covers of line graphs (Q1193439) (← links)
- Forest embeddings in regular graphs of large girth (Q1252244) (← links)
- The complexity of generalized clique covering (Q1262127) (← links)
- Polynomial-time instances of the minimum weight triangulation problem (Q1314524) (← links)
- Stable set bonding in perfect graphs and parity graphs (Q1321990) (← links)
- Edge-disjoint packings of graphs (Q1326750) (← links)
- The existence of uniquely \(-G\) colourable graphs (Q1377702) (← links)
- Hereditary dominating pair graphs (Q1421473) (← links)
- Completeness for intersection classes (Q1584399) (← links)
- On the complexity of the embedding problem for hypercube related graphs (Q1801670) (← links)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs (Q1827809) (← links)
- Isomorphic tree spanner problems (Q1899446) (← links)
- On the structure of trapezoid graphs (Q1917308) (← links)
- Pancyclicity and NP-completeness in planar graphs (Q1962068) (← links)
- Vertex splitting and the recognition of trapezoid graphs (Q2275914) (← links)
- An \(n^ 2\) algorithm for determining the bridges of a graph (Q2550626) (← links)
- 2-tree probe interval graphs have a large obstruction set (Q2565858) (← links)
- On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
- LDFS-Based Certifying Algorithm for the Minimum Path Cover Problem on Cocomparability Graphs (Q2848201) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- (Q3044328) (← links)
- The LBFS Structure and Recognition of Interval Graphs (Q3058537) (← links)
- (Q3139523) (← links)
- Parallel algorithms for parity graphs (Q3201757) (← links)
- (Q3334090) (← links)
- A non-factorial algorithm for canonical numbering of a graph (Q3339303) (← links)
- (Q3351379) (← links)
- Simple vertex ordering characterizations for graph search (Q3439379) (← links)
- Tree Powers (Q4217303) (← links)
- Collective Tree Spanners and Routing in AT-free Related Graphs (Q5301383) (← links)
