Search ResultsElektronik Kaynaklar 
Arama Sonuçlarını Sınırlandır
by
Berge, Claude.
Format:
Alıntı:
Hypergraphs : combinatorics of finite sets / Berge, Claude.
by
Hawkes, P. W.
Format:
Alıntı:
Hypergraphs.
by
Wiśniewski, Remigiusz. author.
Format:
Alıntı:
Introduction -- Related Work -- Perfect Graphs and Comparability Graphs -- Hypergraphs and Exact
by
Cambridge Combinatorial Conference (1977 : Trinity College)
Available from ScienceDirect. Online version available for university members only. This requires an institutional login off-campus.
ScienceDirect http://www.sciencedirect.com/science/book/9780720408430
ScienceDirect http://www.sciencedirect.com/science/publication?issn=01675060&volume=3
ScienceDirect http://www.sciencedirect.com/science/bookseries/01675060/3
ScienceDirect https://www.sciencedirect.com/science/book/9780720408430
ScienceDirect http://www.sciencedirect.com/science/book/9780720408430
ScienceDirect http://www.sciencedirect.com/science/publication?issn=01675060&volume=3
ScienceDirect http://www.sciencedirect.com/science/bookseries/01675060/3
ScienceDirect https://www.sciencedirect.com/science/book/9780720408430
Format:
Alıntı:
decompositions of graphs, directed graphs and hypergraphs; Chapter 4. Extrernal graphs without large forbidden
by
De Silva, Jessica C., author.
Format:
Alıntı:
-type condition and complexity, are just as interesting. We prove that for classes of hypergraphs with certain
by
Rand, G. K. (Graham K.)
ScienceDirect http://www.sciencedirect.com/science/book/9780080333618
Format:
Alıntı:
PERFECT GRAPHSPERFECTLY ORDERABLE GRAPHS; HYPERGRAPHS; REAL DECOMPOSITION OF POLYHEDRA AND
by
Deza, M., 1939-
Format:
Alıntı:
Chapter 34. On adjacency matrices for hypergraphs (Abstract)Chapter 35. Prime triangular matrices
by
White, Arthur T.
Format:
Alıntı:
connections are made to other areas of mathematics, such as hypergraphs, block designs, finite geometries, and
by
Japan Conference on Graph Theory and Applications (1st : 1986 : Hakone-machi, Japan)
Format:
Alıntı:
-Hamiltonian property of Cayley graphs; Chapter 5. Gallai theorems for graphs, hypergraphs, and set systems; Chapter 6
by
Ausiello, G. (Giorgio), 1941-
Available from ScienceDirect. Online version available for university members only. This requires an institutional login off-campus.
ScienceDirect http://www.sciencedirect.com/science/book/9780444876997
ScienceDirect http://www.sciencedirect.com/science/publication?issn=03040208&volume=109
ScienceDirect http://www.sciencedirect.com/science/bookseries/03040208/109
ScienceDirect https://www.sciencedirect.com/science/book/9780444876997
ScienceDirect http://www.sciencedirect.com/science/book/9780444876997
ScienceDirect http://www.sciencedirect.com/science/publication?issn=03040208&volume=109
ScienceDirect http://www.sciencedirect.com/science/bookseries/03040208/109
ScienceDirect https://www.sciencedirect.com/science/book/9780444876997
Format:
Alıntı:
Strongly equivalent directed hypergraphs / G. Ausiello. A. d 'Atri and D. Saccà -- A local
by
Berge, Claude.
Format:
Alıntı:
results; Chapter 1. Minimax theorems for normal hypergraphs and balanced hypergraphs -- A survey; Chapter
by
Hajnal, A.
ScienceDirect https://www.sciencedirect.com/science/book/9780444868930
Format:
Alıntı:
-Jewett's theorem / Size Ramsey numbers involving matchings / Selectivity of hypergraphs / Generalized polymatroids

Eylem Seç




