Classical Perfect Graphs: An introduction with emphasis on triangulated and interval graphs

[1]  Ben Dushnik,et al.  Partially Ordered Sets , 1941 .

[2]  R. Luce.  Semiorders and a Theory of Utility Discrimination , 1956 .

[3]  D. R. Fulkerson.  Note on Dilworth’s decomposition theorem for partially ordered sets , 1956 .

[4]  Ronald Harrop,et al.  Uniformization of Linear Arrays , 1957, J. Symb. Log..

[5]  Patrick Suppes,et al.  Foundational aspects of theories of measurement , 1958, Journal of Symbolic Logic.

[6]  S. Benzer.  ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE. , 1959, Proceedings of the National Academy of Sciences of the United States of America.

[7]  G. Dirac.  On rigid circuit graphs , 1961 .

[8]  E. S. Wolk.  The comparability graph of a tree , 1962 .

[9]  S. Benzer.  The fine structure of the gene. , 1962, Scientific American.

[10]  C. Lekkeikerker,et al.  Representation of a finite graph by a set of intervals on the real line , 1962 .

[11]  Micha A. Peles.  On dilworth’s theorem in the in finite case , 1963 .

[12]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[13]  D. R. Fulkerson,et al.  Incidence matrices and interval graphs , 1965 .

[14]  E. S. Wolk.  A note on “The comparability graph of a tree” , 1965 .

[15]  F. Stahl,et al.  Circular genetic maps , 1967, Journal of cellular physiology.

[16]  T. Gallai.  Transitiv orientierbare Graphen , 1967 .

[17]  Helge Tverberg,et al.  On Dilworth's decomposition theorem for partially ordered sets , 1967 .

[18]  D. Kendall.  Incidence matrices, interval graphs and seriation in archeology. , 1969 .

[19]  P. Renz.  Intersection representations of graphs by arcs. , 1970 .

[20]  D. Rose.  Triangulated graphs and the elimination process , 1970 .

[21]  L. N. Shevrin,et al.  To the undimmed memory of petr Grigor'evich Kontorovich: Partially ordered sets and their comparability graphs , 1970 .

[22]  Peter C. Fishburn,et al.  Betweenness, orders and interval graphs , 1971 .

[23]  A. Lempel,et al.  Transitive Orientation of Graphs and Identification of Permutation Graphs , 1971, Canadian Journal of Mathematics.

[24]  Harold Fredricksen.  Generation of the Ford Sequence of Length 2n, n Large , 1972, J. Comb. Theory, Ser. A.

[25]  László Lovász,et al.  Normal hypergraphs and the perfect graph conjecture , 1972, Discret. Math..

[26]  A. Tucker,et al.  A structure theorem for the consecutive 1's property☆ , 1972 .

[27]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[28]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[29]  Peter Buneman,et al.  A characterisation of rigid circuit graphs , 1974, Discret. Math..

[30]  Kapali P. Eswaran,et al.  Faithful Representation of a Family of Sets by a Set of Intervals , 1975, SIAM J. Comput..

[31]  William T. Trotter,et al.  A note on Dilworth’s embedding theorem , 1975 .

[32]  P. Hammer,et al.  Aggregation of inequalities in integer programming. , 1975 .

[33]  William T. Trotter,et al.  Characterization problems for graphs, partially ordered sets, lattices, and families of sets , 1976, Discret. Math..

[34]  William T. Trotter,et al.  The dimension of a comparability graph , 1976 .

[35]  Daniel J. Kleitman,et al.  The Structure of Sperner k-Families , 1976, J. Comb. Theory, Ser. A.

[36]  Curtis Greene.  Some Partitions Associated with a Partially Ordered Set , 1976, J. Comb. Theory, Ser. A.

[37]  Bruno Leclerc,et al.  Arbres et dimension des ordres , 1976, Discret. Math..

[38]  Alan J. Hoffman,et al.  On partitions of a partially ordered set , 1977, J. Comb. Theory, Ser. B.

[39]  R. Gysin.  Dimension transitiv orientierbarer graphen , 1977 .

[40]  P. Hammer,et al.  Split Graphs Having Dilworth Number Two , 1977, Canadian Journal of Mathematics.

[41]  Yechezkel Zalcstein,et al.  A Graph-Theoretic Characterization of the PV_chunk Class of Synchronizing Primitives , 1977, SIAM J. Comput..

[42]  Oliver Pretzel,et al.  On the Dimension of Partially Ordered Sets , 1977, J. Comb. Theory, Ser. A.

[43]  James R. Walter,et al.  Representations of chordal graphs as subtrees of a tree , 1978, J. Graph Theory.

[44]  J.-C. Fournier.  Isomorphismes d'hypergraphes par intersections équicardinales d'arêtes et configurations exclues , 1980, J. Comb. Theory, Ser. B.

[45]  Jerrold R. Griggs,et al.  On Chains and Sperner k-Families in Ranked Posets, II , 1980, J. Comb. Theory, Ser. A.

[46]  András Frank,et al.  On chain and antichain families of a partially ordered set , 1980, J. Comb. Theory, Ser. B.

[47]  Peter L. Hammer,et al.  The splittance of a graph , 1981, Comb..

[48]  B. Devadas Acharya,et al.  Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality , 1982 .

[49]  Douglas R. Shier,et al.  On powers and centers of chordal graphs , 1983, Discret. Appl. Math..

[50]  J.-C. Fournier.  Hypergraphes de chaines d'aretes d'un arbre , 1983, Discret. Math..

[51]  Jorge Urrutia,et al.  Comparability graphs and intersection graphs , 1983, Discret. Math..