|
7709
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
893
|
Graph Theory with Applications
– Bondy, Murty
- 1976
|
|
866
|
Algorithmic graph theory and perfect graphs
– Golumbic
- 1980
|
|
368
|
Testing for the consecutive ones property, interval graphs, and planarity using PQ-tree algorithms
– Booth, Lueker
- 1976
|
|
157
|
The NP-completeness column: an ongoing guide
– Johnson
- 1984
|
|
71
|
A characterization of comparability graphs and interval graphs
– Gilmore, Hoffman
- 1964
|
|
41
|
Treewidth and pathwidth of permutation graphs
– Bodlaender, Kloks, et al.
- 1993
|
|
31
|
Network Reliability and Algebraic Structures
– Shier
- 1991
|
|
17
|
On a class of posets and the corresponding comparability graphs
– Jung
- 1978
|
|
15
|
Tough graphs and hamiltonian circuits, Discrete Mathematics 5
– Chvátal
- 1973
|
|
14
|
Finding hamiltonian circuits in interval graphs
– Keil
- 1985
|
|
13
|
Vulnerability in Graphs –A Comparative Survey
– Barefoot, Entringer, et al.
- 1987
|
|
13
|
Cycles in tough graphs - Updating the last four years
– Bauer, Schmeichel, et al.
- 1995
|
|
12
|
Treewidth and pathwidth of cocomparability graphs of bounded dimension
– Kloks, Kratsch, et al.
|
|
8
|
Special graph classes --- a survey, Schriftenreihe des Fachbereichs Mathematik, SM-DU-199, Universitat Duisburg Gesamthochschule
– Brandstadt
- 1991
|
|
7
|
Complement reducible graphs, Discrete Applied Mathematics 3
– Corneil, Lerchs, et al.
- 1981
|
|
6
|
An O(n log n) algorithm for the Hamiltonian cycle problem on circular-arc graphs
– Shih, Chern, et al.
- 1992
|
|
5
|
Hamiltonian Circuit in Chordal Bipartite Graphs
– Müller
- 1996
|
|
3
|
Recognizing tough graphs is NP-hard, Discrete Applied Mathematics 28
– Bauer, Hakimi, et al.
- 1990
|
|
3
|
Hamilton circuits in graphs and digraphs', The many facets of graph theory
– NASH-WILLIAMS
- 1969
|
|
1
|
On vertex ranking for permutation and other graphs, to appear in
– Deogun, Kloks, et al.
- 1994
|
|
1
|
Hamiltonian cycle is polynomial on cocomparability graphs
– Deogun, Steiner
|
|
1
|
Toughness, hamiltonicity and split graphs, Forschungsergebnisse Math/93/5, F.-Schiller-Universitat
– Kratsch, Lehel, et al.
- 1993
|
|
1
|
The path partition of cocomparability graphs
– Lehel
- 1991
|
|
1
|
An optimum \Theta(n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals, Information Processing Letters 35
– Manacher, Mankus, et al.
- 1990
|
|
1
|
private communication
– Steiner
|
|
