### Table 1: Results of the paper on interval and chordal graphs

2006

Cited by 5

### Table 1 The complexity status of TREE t-SPANNER on chordal graphs under diameter constraints.

"... In PAGE 3: ... Theorem 3 improves previous results on tree 3-spanners in interval graphs [20,22,27] andon split graphs [6,20,29]. The complexity status of T REE t-SPANNER on chordal graphs consideredin this paper is summarizedin Table1 andFig. 1.... ..."

### Table 1: Numbers of labelled connected (an) and all (An) P4-free chordal graphs with n vertices

2001

Cited by 1

### Table 2: Numbers of labelled connected P4-free chordal graphs with n vertices and q edges

2001

"... In PAGE 7: ... Again by the exponential relationship, P n 0;q 0 An;qxnyq=n! = exp(P n 0;q 0 an;qxnyq=n!), which leads to An;q = an;q + q X l=0 1 n n 1 X k=1 k n k ! ak;lAn k;q l !! : (4) Together, (3) and (4) determine the numbers an;q recursively, beginning with a2;1 = 1. Table2 gives the resulting values of an;q for small n. 3.... ..."

Cited by 1

### Table 1: Numbers of labelled connected (an) and all (An) P4-free chordal graphs with n vertices

2001

Cited by 1

### Table 2. Comparative performance of our spilling heuristics for chordal and non- chordal interference graphs.

2005

"... In PAGE 11: ... Furthermore, both algorithms can execute a cubic number of coalescings, but, in the average, the quantity of copy instructions per program is small when compared to the total number of instructions. Table2 compares the two algorithms when the interference graphs are chordal... ..."

Cited by 9

### Table 1: Optimal upper bounds for the clique number, inductiveness, and chromatic number of the square of a chordal / non-chordal outerplanar graph G.

2004

"... In PAGE 4: ... We examine in detail the low-degree cases, lt; 7, and derive best possible upper bounds on the maximum clique and chromatic numbers, as well as inductiveness of squares of outerplanar graphs. These bounds are illustrated in Table1 . We treat the special case of chordal outerplanar graphs separately, and further classify all chordal outerplanar graphs G for which the inductiveness of G2 exceeds or the clique or chromatic number of G2 exceed + 1.... In PAGE 17: ...orollary 4.10 together with Theorems 4.3 and 4.5 complete the proof of Theorem 4.1 as well as the entries in Table1 in the chordal case for 2 f2; 3; 4; 5; 6g. Observation 4.... ..."

Cited by 4

### Table 1: Separating examples between chordal probe graphs and related incomparable classes.

2005

### Table 1: Optimal upper bounds for the clique number, inductiveness, and chromatic number of the square of a chordal / non-chordal outerplanar graph G.

### Table 3: The Modified Chordal Variant of the Balas-Yu Algorithm Graph

2007

Cited by 2