Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Décomposition graphe")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 1267

  • Page / 51

Export

Selection :

  • and

Decomposition of the complete hypergraph into delta-systems IIMOUYART, A. F; STERBOUL, F.Journal of combinatorial theory. Series A. 1986, Vol 41, Num 1, pp 139-149, issn 0097-3165Article

On the cycle space of graphsMOHAR, B.Discrete mathematics. 1986, Vol 58, Num 1, pp 79-80, issn 0012-365XArticle

Sur les graphes de partition d'un rectangle IIBUSNYUK, N. N; SARVANOV, V. I.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1986, Num 2, pp 3-7, issn 0002-3574Article

Sur les graphes de partition d'un rectangle. IBUSNYUK, N. N; SARVANOV, V. I.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1985, Num 6, pp 29-36, issn 0002-3574Article

CONVEX DECOMPOSITION OF GRAPHS.PULLEYBLANK WR.1976; IN: BR. COMB. CONF. 5. PROC.; ABADEEN; 1975; WINNIPEG; UTILITAS MATHEMATICA; DA. 1976; PP. 503-508; BIBL. 3 REF.Conference Paper

On universality of graphs with uniformly distributed edgesRODL, V.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 125-134, issn 0012-365XArticle

On decomposition of hypergraphs into △-systemsLONC, Z.Journal of combinatorial theory. Series A. 1989, Vol 52, Num 1, pp 158-162, issn 0097-3165Article

Decomposition of perfect graphsWEN-LIAN HSU.Journal of combinatorial theory. Series B. 1987, Vol 43, Num 1, pp 70-94, issn 0095-8956Article

Complete subgraphs of infinite multipartite graphs and antichains in partially oredered setsHAJNAL, A; SAUER, N.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 61-67, issn 0012-365XArticle

ON CHAINLIKE DECOMPOSITIONS OF GRAPHS.HALIN R.1976; IN: BR. COMB. CONF. 5. PROC.; ABERDEEN; 1975; WINNIPEG; UTILITAS MATHEMATICA; DA. 1976; PP. 268Conference Paper

Hypergraph decomposition and secret sharingDI CRESCENZO, Giovanni; GALDI, Clemente.Lecture notes in computer science. 2003, pp 645-654, issn 0302-9743, isbn 3-540-20695-7, 10 p.Conference Paper

Non-isomorphic 2-perfect 6-cycle systems of order 13GOWER, R. A. H.Bulletin of the Australian Mathematical Society. 1991, Vol 44, Num 3, pp 381-385, issn 0004-9727Article

Decomposition of graphs into chainsTHOMASSEN, C.Bulletin of the London Mathematical Society. 1986, Vol 18, Num 72, pp 248-254, issn 0024-6093Article

Packings by complete bipartite graphsHELL, P; KIRKPATRICK, D. G.SIAM journal on algebraic and discrete methods. 1986, Vol 7, Num 2, pp 199-209, issn 0196-5212Article

Some sequences associated with combinatorial structuresSAKS, M.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 135-166, issn 0012-365XArticle

Minimal clique partitions and parwise balanced designsREES, R.Discrete mathematics. 1986, Vol 61, Num 2-3, pp 269-280, issn 0012-365XArticle

Vertex-transitive triangulations of compact orientable 2-manifoldsSUROWSKI, D. B.Journal of combinatorial theory. Series B. 1985, Vol 39, Num 3, pp 371-375, issn 0095-8956Article

Graph decompositions without isolatesLINIAL, N.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 1, pp 16-25, issn 0095-8956Article

DECOMPOSITION OF K*P, FOR P A PRIME, INTO K-CIRCUITS.HARTNELL B; MILGRAM M.1975; CAH. CENTRE ET. RECH. OPERAT.; BELG.; DA. 1975; VOL. 17; NO 2-4; PP. 221-223; BIBL. 2 REF.; (COLLOQ. THEOR. GRAPHES; PARIS; 1974)Conference Paper

List partitions of chordal graphsFEDER, Tomas; HELL, Pavol; KLEIN, Sulamita et al.Lecture notes in computer science. 2004, pp 100-108, issn 0302-9743, isbn 3-540-21258-2, 9 p.Conference Paper

A decomposition for strongly perfect graphsOLARIU, S.Journal of graph theory. 1989, Vol 13, Num 3, pp 301-311, issn 0364-9024Article

A short proof of Kundu's k-factor theoremYONG-CHUAN CHEN.Discrete mathematics. 1988, Vol 71, Num 2, pp 177-179, issn 0012-365XArticle

Randomly decomposable graphsRUIZ, S.Discrete mathematics. 1985, Vol 57, Num 1-2, pp 123-128, issn 0012-365XArticle

On optimal ear-decompositions of graphsSZIGETI, Z.Lecture notes in computer science. 1999, pp 415-428, issn 0302-9743, isbn 3-540-66019-4Conference Paper

On bounds for the k-partitioning of graphsBEZRUKOV, S. L; ELSÄSSER, R; SCHROEDER, U.-P et al.Lecture notes in computer science. 1999, pp 154-163, issn 0302-9743, isbn 3-540-66200-6Conference Paper

  • Page / 51