Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Graph decomposition")

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 1205

  • Page / 49

Export

Selection :

  • and

Oberwolfach rectangular table negotiation problemFRONCEK, Dalibor.Discrete mathematics. 2009, Vol 309, Num 2, pp 501-504, issn 0012-365X, 4 p.Conference Paper

O(m log n) split decomposition of strongly-connected graphsJOERIS, Benson L; LUNDBERG, Scott; MCCONNELL, Ross M et al.Discrete applied mathematics. 2010, Vol 158, Num 7, pp 779-799, issn 0166-218X, 21 p.Article

Degree-constrained decompositions of graphs : Bounded treewidth and planarityBAZGAN, Cristina; TUZA, Zsolt; VANDERPOOTEN, Daniel et al.Theoretical computer science. 2006, Vol 355, Num 3, pp 389-395, issn 0304-3975, 7 p.Article

All graphs with maximum degree three whose complements have 4-cycle decompositionsFU, Chin-Mei; FU, Hung-Lin; RODGER, C. A et al.Discrete mathematics. 2008, Vol 308, Num 13, pp 2901-2909, issn 0012-365X, 9 p.Article

Decomposition of almost complete tripartite graphs into two isomorphic factors of fixed diameterEISCHEN, Ellen E.Discrete mathematics. 2006, Vol 306, Num 8-9, pp 745-761, issn 0012-365X, 17 p.Article

HIGH-LYING PROTON STRENGTHS OBSERVED IN STRIPPING REACTIONS1982; ; FRA; DA. 1982; IPNO-DRE/82-16; 11 P.-2 PL.; 30 CM; BIBL. 24 REF.Report

Decompositions of λKvRODGER, C. A; WESTBROOK, S. K.Journal of combinatorial optimization. 2007, Vol 14, Num 2-3, pp 259-265, issn 1382-6905, 7 p.Conference Paper

ρ-Valuations for some stunted treesKEZDY, André E.Discrete mathematics. 2006, Vol 306, Num 21, pp 2786-2789, issn 0012-365X, 4 p.Article

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

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 universality of graphs with uniformly distributed edgesRODL, V.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 125-134, issn 0012-365XArticle

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

Relative Difference Families With Variable Block Sizes and Their Related OOCsBURATTI, Marco; YUEER WEI; DIANHUA WU et al.IEEE transactions on information theory. 2011, Vol 57, Num 11, pp 7489-7497, issn 0018-9448, 9 p.Article

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

  • Page / 49