Previous |  Up |  Next

Article

Title: On a certain numbering of the vertices of a hypergraph (English)
Author: Nebeský, Ladislav
Language: English
Journal: Czechoslovak Mathematical Journal
ISSN: 0011-4642 (print)
ISSN: 1572-9141 (online)
Volume: 33
Issue: 1
Year: 1983
Pages: 1-6
Summary lang: Russian
.
Category: math
.
MSC: 05C20
MSC: 05C65
idZBL: Zbl 0519.05051
idMR: MR687411
DOI: 10.21136/CMJ.1983.101849
.
Date available: 2008-06-09T14:51:48Z
Last updated: 2020-07-28
Stable URL: http://hdl.handle.net/10338.dmlcz/101849
.
Reference: [1] C. Berge: Graphs and Hypergraphs.North-Holland, Amsterdam, London 1973. Zbl 0254.05101, MR 0357172
Reference: [2] K. P. Eswaran: Faithful representation of a family of sets by a set of intervals.SIAM J. Comput 4 (1975), 56-68. Zbl 0294.68007, MR 0378509, 10.1137/0204005
Reference: [3] D. R. Fulkerson, O. A. Gross: Incidence matrices and interval graphs.Pacific J. Math. 15 (1965), 835-855. Zbl 0132.21001, MR 0186421, 10.2140/pjm.1965.15.835
Reference: [4] F. Harary: Graph Theory.Addison-Wesley, Reading (Mass.) 1969. Zbl 0196.27202, MR 0256911
Reference: [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 0567125
Reference: [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. MR 0450140, 10.1016/S0012-365X(76)80011-8
Reference: [7] A. Tucker: A structure theorem for the consecutive 1's property.J. Combinatorial Theory 12 (B) (1972), 153-162. Zbl 0208.52402, MR 0295938, 10.1016/0095-8956(72)90019-6
.

Files

Files Size Format View
CzechMathJ_33-1983-1_2.pdf 830.3Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo