Decomposable graphs and hypergraphs

On definit et on etudie la notion d'hypergraphe decomposable en montrant qu'un tel hypergraphe est toujours conforme

[1]  S. Parter.  The Use of Linear Graphs in Gauss Elimination , 1961 .

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

[3]  N. N. Vorob’ev.  Consistent Families of Measures and Their Extensions , 1962 .

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

[5]  N. N. Vorob’ev.  Markov Measures and Markov Extensions , 1963 .

[6]  H. Kellerer.  Verteilungsfunktionen mit gegebenen Marginalverteilungen , 1964 .

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

[8]  Frank Harary,et al.  Graph Theory , 2016 .

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

[10]  L. A. Goodman.  Partitioning of Chi-Square, Analysis of Marginal Contingency Tables, and Estimation of Expected Frequencies in Multidimensional Contingency Tables , 1971 .

[11]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[12]  D. Rose.  A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .

[13]  Donald J. Rose,et al.  Toward Characterization of Perfect Elimination Digraphs , 1973, SIAM J. Comput..

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

[15]  D. J. KLEITMAN,et al.  A Note on Perfect Elimination Digraphs , 1974, SIAM J. Comput..

[16]  Stephen E. Fienberg,et al.  Discrete Multivariate Analysis: Theory and Practice , 1976 .

[17]  Fanica Gavril,et al.  An Algorithm for Testing Chordality of Graphs , 1975, Inf. Process. Lett..

[18]  George Schick Lueker.  Efficient algorithms for chordal graphs and interval graphs. , 1975 .

[19]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[20]  Tatsuo Ohtsuki,et al.  A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph , 1976, SIAM J. Comput..

[21]  T. Ohtsuki,et al.  Minimal triangulation of a graph and optimal pivoting order in a sparse matrix , 1976 .

[22]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .