Geodesic
Hypergraphs and intervals
Czechoslovak Mathematical Journal, Tome 31 (1981) no. 3, pp. 469-474
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

DOI : 10.21136/CMJ.1981.101761
Classification : 05C65, 05C75 
@article{10_21136_CMJ_1981_101761,
     author = {Nebesk\'y, Ladislav},
     title = {Hypergraphs and intervals},
     journal = {Czechoslovak Mathematical Journal},
     pages = {469--474},
     year = {1981},
     volume = {31},
     number = {3},
     doi = {10.21136/CMJ.1981.101761},
     mrnumber = {626920},
     zbl = {0473.05047},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1981.101761/}
}
TY  - JOUR
AU  - Nebeský, Ladislav
TI  - Hypergraphs and intervals
JO  - Czechoslovak Mathematical Journal
PY  - 1981
SP  - 469
EP  - 474
VL  - 31
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1981.101761/
DO  - 10.21136/CMJ.1981.101761
LA  - en
ID  - 10_21136_CMJ_1981_101761
ER  - 
%0 Journal Article
%A Nebeský, Ladislav
%T Hypergraphs and intervals
%J Czechoslovak Mathematical Journal
%D 1981
%P 469-474
%V 31
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1981.101761/
%R 10.21136/CMJ.1981.101761
%G en
%F 10_21136_CMJ_1981_101761
Nebeský, Ladislav. Hypergraphs and intervals. Czechoslovak Mathematical Journal, Tome 31 (1981) no. 3, pp. 469-474. doi: 10.21136/CMJ.1981.101761

[1] M. Behzad G. Chartrand, L. Lesniak-Foster: Graphs & Digraphs. Prindle, Weber & Schmidt, Boston 1979. | MR

[2] С. Berge: Graphs and Hypergraphs. North-Holland, Amsterdam 1973. | Zbl

[3] K. P. Eswaran: Faithful representation of a family of sets by a set of intervals. SIAM J. Comput. 4 (1975), 56-68. | DOI | MR | Zbl

[4] D. R. Fulkerson, O. Gross: Incidence matrices and interval graphs. Рас. J. Math. 15 (1965), 835-855. | MR | Zbl

[5] P. C. Gilmore, A. J. Hoffman: A characterization of comparability graphs and of interval graphs. Canad. J. Math. 16 (1964), 539-548. | DOI | MR | Zbl

[6] F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.) 1969. | MR | Zbl

[7] C. G. Lekkerkerker, J. Ch. Boland: Representation of a finite graph by a set of intervals on the real line. Fund. Math. 51 (1962), 45-64. | DOI | MR | Zbl

[8] L. Nebeský: Graph theory and linguistics. In: Applications of Graph Theory (R. J. Wilson and L. W. Beineke, eds.). Academic Press, London 1979, pp. 357-380. | MR

[9] L. Nebeský: On a certain numbering of the vertices of a hypergraph. To appear. | MR

[10] W. T. Trotter, Jr., J. I. Moore, Jr.: Characterization problems for graphs, partially ordered sets, lattices, and families of sets. Discrete Math. 16 (1976), 361 - 381. | DOI | MR

[11] A. Tucker: A structure theorem for the consecutive 1's property. J. Combinatorial Theory 12 (B) (1972), 153-162. | DOI | MR | Zbl

Cité par Sources :