Covering and coloring problems for relatives of intervals
暂无分享,去创建一个
[1] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[2] Branko Grünbaum,et al. On a Coloring Problem. , 1960 .
[3] R. Rado,et al. Covering Theorems for Ordered Sets , 1948 .
[4] András Gyárfás,et al. Hypergraph families with bounded edge cover or transversal number , 1983, Comb..
[5] B. Roy. Nombre chromatique et plus longs chemins d'un graphe , 1967 .
[6] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[7] V. Klee,et al. Helly's theorem and its relatives , 1963 .
[8] Douglas B. West,et al. Extremal Values of the Interval Number of a Graph , 1980, SIAM J. Matrix Anal. Appl..
[9] A. Tucker,et al. Coloring a Family of Circular Arcs , 1975 .
[10] András Gyárfás,et al. On the chromatic number of multiple interval graphs and overlap graphs , 1985, Discret. Math..
[11] Frank Harary,et al. On double and multiple interval graphs , 1979, J. Graph Theory.