The following pages link to Alan C. Tucker (Q1110542):
Displaying 50 items.
- Counterexamples to three conjectures concerning perfect graphs (Q686172) (← links)
- On circular critical graphs (Q796546) (← links)
- Sur la génération des arbres binaires par les B-suites (Q798328) (← links)
- Graph minors. III. Planar tree-width (Q799684) (← links)
- On linear-time algorithms for five-coloring planar graphs (Q1057278) (← links)
- An O(qn) algorithm to q-color a proper family of circular arcs (Q1060020) (← links)
- Reconstruction of hypertrees (Q1065031) (← links)
- Coloring perfect \((K_ 4\)-e)-free graphs (Q1071025) (← links)
- Hexagonal coordinate systems and Steiner minimal trees (Q1080858) (← links)
- The number of trees with a 1-factor (Q1085165) (← links)
- Steiner minimal trees for regular polygons (Q1085166) (← links)
- Monotonically labelled Motzkin trees (Q1092056) (← links)
- Maximum of k-th maximal spanning trees of a weighted graph (Q1092057) (← links)
- Expanding graphs contain all small trees (Q1092058) (← links)
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs (Q1096639) (← links)
- Bounds on the convex label number of trees (Q1103629) (← links)
- Greedy packing and series-parallel graphs (Q1110543) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- End vertices in interval graphs (Q1119662) (← links)
- (Q1171065) (redirect page) (← links)
- Coloring graphs with stable cutsets (Q1171066) (← links)
- Generalized activities and the Tutte polynomial (Q1173634) (← links)
- Improved computation of plane Steiner minimal trees (Q1186797) (← links)
- Steiner minimal trees for a class of zigzag lines (Q1186798) (← links)
- Problems with generalized Steiner problems (Q1186806) (← links)
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets (Q1197003) (← links)
- The asymptotic distribution of leaf heights in binary trees (Q1199121) (← links)
- A Turán-type theorem on chords of a convex polygon (Q1204472) (← links)
- Recognizing hidden bicircular networks (Q1208462) (← links)
- Critical perfect graphs and perfect 3-chromatic graphs (Q1245851) (← links)
- Minimal nonstandard Coxeter trees (Q1312864) (← links)
- Balanced matrices with row sum 3 (Q1336681) (← links)
- Diagonal flips in triangulations of surfaces (Q1343263) (← links)
- Three nonisomorphic triangulations of an orientable surface with the same complete graph (Q1343277) (← links)
- Pentagonal 3-polytopal graphs with edges of only two types and shortness parameters (Q1343788) (← links)
- Direction trees (Q1820788) (← links)
- An algorithm for colouring perfect planar graphs (Q1825203) (← links)
- On the semi-perfect elimination (Q1825204) (← links)
- Uniquely colorable perfect graphs (Q1837699) (← links)
- The cost of a class of optimal binary trees (Q1844596) (← links)
- Strongly perfect infinite graphs (Q1895072) (← links)
- Ordered colourings (Q1896351) (← links)
- Chromatic sums revisited (Q1897771) (← links)
- Partitions and normal trees (Q2276968) (← links)
- A structure theorem for the consecutive 1's property (Q2543431) (← links)
- Matrix characterizations of circular-arc graphs (Q2548968) (← links)
- Structure theorems for some circular-arc graphs (Q2563173) (← links)
- What Every Mathematician Should Know about Standards-Based Tests (Q3002532) (← links)
- (Q3117560) (← links)
- (Q3173626) (← links)
