Entry Brandstadt:1997:HOG from tcs1995.bib
Last update: Sun Oct 15 02:56:11 MDT 2017
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Brandstadt:1997:HOG,
author = "Andreas Brandst{\"a}dt and Feodor F. Dragan and Falk
Nicolai",
title = "Homogeneously orderable graphs",
journal = j-THEOR-COMP-SCI,
volume = "172",
number = "1--2",
pages = "209--232",
day = "10",
month = feb,
year = "1997",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:20:35 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1997&volume=172&issue=1-2;
http://www.math.utah.edu/pub/tex/bib/tcs1995.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1997&volume=172&issue=1-2&aid=2294",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4260
(Computational geometry); C6120 (File organisation)",
corpsource = "Fachbereich Inf., Rostock Univ., Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "closed neighborhoods; computational geometry;
distance-hereditary graphs; dually chordal graphs;
forbidden induced subgraphs; graph theory; homogeneous
graphs; homogeneously orderable graphs;
house-hole-domino-sun-free graphs; polynomial-time
recognition algorithm; Steiner tree problem; tree data
structures; tree structure",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- C4260,
137(1)145,
137(2)177,
140(2)205,
140(2)249,
140(2)265,
140(2)291,
140(2)301,
141(1)337,
143(1)113,
143(1)175,
143(2)189,
143(2)309,
143(2)343,
145(1)27,
145(1)241,
145(1)329,
145(1)381,
147(1)211,
148(1)57,
148(1)93,
151(1)257,
155(2)321,
156(1)1,
156(1)159,
157(1)35,
157(1)53,
157(1)z,
157(2)185,
159(1)103,
159(1)105,
159(1)129,
159(1)137,
162(2)351,
163(1)303,
164(1)59,
164(1)165,
168(1)121,
169(2)147,
172(1)121,
172(1)175,
172(1)233,
172(1)265,
174(1)193,
175(2)239,
180(1)363,
181(1)3,
181(1)57,
181(1)91,
181(1)107,
182(1)233,
186(1)1,
188(1)59,
188(1)129,
191(1)193,
194(1)z,
197(1)203
- C6120,
139(1)69,
140(1)179,
140(2)249,
144(1)3,
144(1)161,
144(1)199,
144(1)221,
144(1)251,
146(1)243,
148(1)171,
149(1)49,
149(1)151,
149(1)179,
152(2)269,
154(1)85,
154(2)165,
155(2)349,
156(1)39,
156(1)315,
158(1)1,
159(2)191,
160(1)217,
163(1)239,
164(1)1,
164(1)73,
164(1)107,
165(1)201,
165(2)391,
166(1)147,
167(1)3,
168(1)21,
168(1)155,
169(1)67,
169(1)113,
172(1)1,
173(2)349,
173(2)513,
175(2)373,
177(1)183,
178(1)103,
178(1)171,
181(1)3,
181(1)75,
182(1)1,
182(1)145,
182(1)183,
183(2)157,
188(1)1,
192(2)201,
196(1)109,
197(1)95
- chordal,
140(2)291,
147(1)69
- closed,
138(1)67,
138(1)141,
141(1)133,
143(2)189,
154(2)379,
155(1)1,
155(1)221,
155(1)265,
158(1)371,
160(1)145,
166(1)203,
175(1)159,
177(2)287,
184(1)145,
194(1)219,
219(1)65,
228(1)77
- file,
139(1)69,
140(1)179,
140(2)249,
141(1)283,
144(1)3,
144(1)161,
144(1)199,
144(1)221,
144(1)251,
146(1)243,
148(1)171,
149(1)49,
149(1)151,
149(1)179,
152(2)269,
154(1)85,
154(2)165,
155(2)349,
156(1)39,
156(1)315,
158(1)1,
159(1)15,
159(2)191,
160(1)217,
163(1)239,
164(1)1,
164(1)73,
164(1)107,
165(1)201,
165(2)391,
166(1)147,
167(1)3,
168(1)21,
168(1)155,
169(1)67,
169(1)113,
172(1)1,
173(2)349,
173(2)513,
175(2)373,
177(1)183,
178(1)103,
178(1)171,
181(1)3,
181(1)75,
182(1)1,
182(1)145,
182(1)183,
183(2)157,
188(1)1,
192(2)201,
196(1)109,
197(1)95
- forbidden,
145(1)111
- homogeneous,
154(1)41,
187(1)27
- induced,
155(1)39,
172(1)265
- neighborhood,
168(2)337,
191(1)229
- orderable,
145(1)147
- organisation,
139(1)69,
140(1)179,
140(2)249,
141(1)283,
144(1)3,
144(1)161,
144(1)199,
144(1)221,
144(1)251,
146(1)243,
148(1)171,
149(1)49,
149(1)151,
149(1)179,
152(2)269,
154(1)85,
154(2)165,
155(2)349,
156(1)39,
156(1)315,
158(1)1,
159(1)15,
159(2)191,
160(1)217,
163(1)239,
164(1)1,
164(1)73,
164(1)107,
165(1)201,
165(2)391,
166(1)147,
167(1)3,
168(1)21,
168(1)155,
169(1)67,
169(1)113,
172(1)1,
173(2)349,
173(2)513,
175(2)373,
177(1)183,
178(1)103,
178(1)171,
181(1)3,
181(1)75,
182(1)1,
182(1)145,
182(1)183,
183(2)157,
188(1)1,
192(2)201,
196(1)109,
197(1)95
- polynomial-time,
137(1)129,
137(2)279,
141(1)109,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
174(1)23,
181(1)159,
181(2)229,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89
- recognition,
140(2)319,
143(1)73,
143(2)343,
145(1)329,
145(1)357,
152(2)171,
154(2)165,
154(2)183,
154(2)203,
155(2)321,
156(1)281,
160(1)217,
163(1)117,
163(1)303,
173(2)349,
175(2)349,
175(2)393,
178(1)129,
178(1)225,
178(1)275,
180(1)115,
180(1)269,
181(2)379,
197(1)189,
201(1)99
- Steiner,
215(1)359
- subgraph,
145(1)111,
145(1)147,
148(1)57,
161(1)307,
164(1)287,
168(1)121,
172(1)265,
181(1)91,
181(2)307,
203(1)91,
205(1)85,
205(1)261
- time, polynomial-,
137(1)129,
137(2)279,
141(1)175,
145(1)147,
145(1)241,
145(1)371,
148(2)207,
148(2)325,
150(1)1,
155(2)447,
158(1)221,
174(1)23,
181(1)159,
184(1)237,
185(1)191,
191(1)215,
193(1)149,
194(1)137,
196(1)131,
207(1)89