Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ct.\*:("Combinatorics. Ordered structures")

Filter

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

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 23780

  • Page / 952

Export

Selection :

  • and

Graph-polynomialsTUTTE, W. T.Advances in applied mathematics (Print). 2004, Vol 32, Num 1-2, pp 5-9, issn 0196-8858, 5 p.Article

Excluded-minor characterizations of antimatroids arisen from posets and graph searchesNAKAMURA, M.Discrete applied mathematics. 2003, Vol 129, Num 2-3, pp 487-498, issn 0166-218X, 12 p.Article

Matching-star Ramsey setsMENGERSEN, I; OECKERMANN, J.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 417-424, issn 0166-218XConference Paper

The sand-pile model and Tutte polynomialsCORI, Robert; LE BORGNE, Yvan.Advances in applied mathematics (Print). 2003, Vol 30, Num 1-2, pp 44-52, issn 0196-8858, 9 p.Conference Paper

Difference sets with few character valuesTAO FENG; SIHUANG HU; SHUXING LI et al.Designs, codes and cryptography. 2014, Vol 73, Num 3, pp 825-839, issn 0925-1022, 15 p.Article

Abelian and non-abelian Paley type group schemesYU QING CHEN; TAO FENG.Designs, codes and cryptography. 2013, Vol 68, Num 1-3, pp 141-154, issn 0925-1022, 14 p.Article

Girth, pebbling, and grid thresholdsCZYGRINOW, Andrzej; HURLBERT, Glenn.SIAM journal on discrete mathematics (Print). 2007, Vol 20, Num 1, pp 1-10, issn 0895-4801, 10 p.Article

Cuts and boundsNESETRIL, Jaroslav; OSSONA DE MENDEZ, Patrice.Discrete mathematics. 2005, Vol 302, Num 1-3, pp 211-224, issn 0012-365X, 14 p.Article

A spectral lower bound for the treewidth of a graph and its consequencesSUNIL CHANDRAN, L; SUBRAMANIAN, C. R.Information processing letters. 2003, Vol 87, Num 4, pp 195-200, issn 0020-0190, 6 p.Article

Jumping succession rules and their generating functionsFERRARI, Luca; PERGOLA, Elisa; PINZANI, Renzo et al.Discrete mathematics. 2003, Vol 271, Num 1-3, pp 29-50, issn 0012-365X, 22 p.Article

Proceedings of the 5th Twente Workshop on Graphs and Combinatorial OptimizationFAIGLE, U; HOEDE, C.Discrete applied mathematics. 2000, Vol 99, Num 1-3, issn 0166-218X, 457 p.Conference Proceedings

Balanced colourings of strongly regular graphsBAILEY, R. A.Discrete mathematics. 2005, Vol 293, Num 1-3, pp 73-90, issn 0012-365X, 18 p.Conference Paper

Trapezoidal lattice paths and multivariate analoguesLOEHR, N.Advances in applied mathematics (Print). 2003, Vol 31, Num 4, pp 597-629, issn 0196-8858, 33 p.Article

Analyse combinatoire avancée = Advanced combinatorial analysisCOMTET, Louis.Techniques de l'ingénieur. Sciences fondamentales. 2001, Vol AF2, Num AF201, pp AF201.1-AF201.29, issn 1764-0547Article

Designs, groups and latticesBACHOC, Christine.Journal de théorie des nombres de Bordeaux. 2005, Vol 17, Num 1, pp 25-44, issn 1246-7405, 20 p.Conference Paper

Enumerative aspects of secondary structuresDOSLIC, Tomislav; SVRTAN, Dragutin; VELJAN, Darko et al.Discrete mathematics. 2004, Vol 285, Num 1-3, pp 67-82, issn 0012-365X, 16 p.Article

The Gutman formulas for algebraic structure countBODROZA-PANTIC, Olga; DOROSLOVACKI, Rade.Journal of mathematical chemistry. 2004, Vol 35, Num 2, pp 139-146, issn 0259-9791, 8 p.Article

A universal bound for a covering in regular posets and its application to pool testingLEVENSHTEIN, Vladimir I.Discrete mathematics. 2003, Vol 266, Num 1-3, pp 293-309, issn 0012-365X, 17 p.Conference Paper

Some bijective results about the area of Schröder pathsFERRARI, L; GRAZZINI, E; PERGOLA, E et al.Theoretical computer science. 2003, Vol 307, Num 2, pp 327-335, issn 0304-3975, 9 p.Conference Paper

A note on the determination and construction of minimal othogonal main-effect plansJACROUX, M.Technometrics. 1992, Vol 34, Num 1, pp 92-96, issn 0040-1706Article

A characterisation of graphs having three pairwise compatible Euler toursJACKSON, B.Journal of combinatorial theory. Series B. 1991, Vol 53, Num 1, pp 80-92, issn 0095-8956Article

A combinatorial proof of a refinement of the Andrews-Olsson partition identityBESSENRODT, C.European journal of combinatorics. 1991, Vol 12, Num 4, pp 271-276, issn 0195-6698Article

An Ω(n5/4) lower bound on the randomized complexity of graph propertiesKING, V.Combinatorica (Print). 1991, Vol 11, Num 1, pp 23-32, issn 0209-9683Article

Constructing self-dual codes using graphsORAL, H.Journal of combinatorial theory. Series B. 1991, Vol 52, Num 2, pp 250-258, issn 0095-8956Article

Planck distribution for a q-boson gasMARTIN-DELGADO, M. A.Journal of physics. A, mathematical and general. 1991, Vol 24, Num 21, pp L1285-L1291, issn 0305-4470Article

  • Page / 952