|
991
|
Algorithmic Graph Theory And Perfect Graphs
– M C Golumbic
- 1980
|
|
112
|
Representation of a finite graphs by a set of intervals on the real line
– C G Lekkerkerker, J C Boland
- 1962
|
|
12
|
A Linear Time Algorithm to Compute a Dominating Path in an AT-free Graph
– Derek G. Corneil, Stephan Olariu, Lorna Stewart
- 1998
|
|
267
|
Complexity of finding embeddings in a k-tree
– S Arnborg, D Corneil, A Proskourowski
- 1987
|
|
156
|
Computing the minimum fill-in is NP-complete
– M Yannakakis
- 1981
|
|
261
|
Algorithmic aspects of vertex elimination on graphs
– D J Rose, R E Tarjan, G S Lueker
- 1976
|
|
406
|
G.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-trees
– K Booth, Lueker
- 1976
|
|
206
|
Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs
– R E Tarjan, M Yannakakis
- 1984
|
|
24
|
Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
– Derek G. Corneil, Stephan Olariu, Lorna Stewart
- 1997
|
|
30
|
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
– Ton Kloks, Dieter Kratsch, Haiko Müller
|
|
35
|
Characterizations of strongly chordal graphs
– M Farber
- 1983
|
|
15
|
Extensions of permutation and interval graphs, in
– D G Corneil, P A Kamula
- 1987
|
|
25
|
Domination on cocomparability graphs
– D Kratsch, L K Stewart
- 1993
|
|
24
|
A linear time algorithm for deciding interval graph isomorphism
– G S LUEKEr, K S BOOTH
- 1979
|
|
24
|
R.Y.Pinter.Trapezoid graphs and their coloring
– M C Golumbic I Dagan
- 1988
|
|
24
|
Permutation graphs and transitive graphs
– S Even, A Pnueli, A Lempel
- 2012
|
|
320
|
Graph minors II: Algorithmic aspects of tree-width
– N Robertson, P Seymour
- 1986
|
|
5
|
Rangan, Connected domination and Steiner set on asteroidal triple-free graphs
– H Balakrishnan, A
- 1993
|
|
234
|
Graph classes: a survey
– A Brandstadt, V B Le, J P Spinrad
- 1999
|
