Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Nebeský, Ladislav. On a certain numbering of the vertices of a hypergraph. Czechoslovak Mathematical Journal, Tome 33 (1983) no. 1, pp. 1-6. doi: 10.21136/CMJ.1983.101849
@article{10_21136_CMJ_1983_101849,
author = {Nebesk\'y, Ladislav},
title = {On a certain numbering of the vertices of a hypergraph},
journal = {Czechoslovak Mathematical Journal},
pages = {1--6},
year = {1983},
volume = {33},
number = {1},
doi = {10.21136/CMJ.1983.101849},
mrnumber = {687411},
zbl = {0519.05051},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1983.101849/}
}
TY - JOUR AU - Nebeský, Ladislav TI - On a certain numbering of the vertices of a hypergraph JO - Czechoslovak Mathematical Journal PY - 1983 SP - 1 EP - 6 VL - 33 IS - 1 UR - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.1983.101849/ DO - 10.21136/CMJ.1983.101849 LA - en ID - 10_21136_CMJ_1983_101849 ER -
[1] C. Berge: Graphs and Hypergraphs. North-Holland, Amsterdam, London 1973. | MR | Zbl
[2] 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
[3] D. R. Fulkerson, O. A. Gross: Incidence matrices and interval graphs. Pacific J. Math. 15 (1965), 835-855. | DOI | MR | Zbl
[4] F. Harary: Graph Theory. Addison-Wesley, Reading (Mass.) 1969. | MR | Zbl
[5] 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
[6] W. T. Trotter, Jr., J. I. Moore, Jr.: Characterization problems for graphs, partially ordered sets, lattices, and families of sets. Discrete Mathematics 16 (1976), 361 - 381. | DOI | MR
[7] 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 :