Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Recouvrement")

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

Origin

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

Results 1 to 25 of 12151

  • Page / 487
Export

Selection :

  • and

On the minimal covering of infinite setsKLIMO, J.Discrete applied mathematics. 1993, Vol 45, Num 2, pp 161-168, issn 0166-218XArticle

Regular fourfold coverings with respect to the identity automorphismSUNGPYO HONG; JIN HO KWAK.Journal of graph theory. 1993, Vol 17, Num 5, pp 621-627, issn 0364-9024Article

The least point covering and domination numbers of a graphSAMPATHKUMAR, E.Discrete mathematics. 1990, Vol 86, Num 1-3, pp 137-142, issn 0012-365X, 6 p.Article

Eigenvalue estimates with applications to minimal surfacesTYSK, J.Pacific journal of mathematics. 1987, Vol 128, Num 2, pp 361-366, issn 0030-8730Article

On total covers of graphsALAVI, Y; LIU, J; WANG, J et al.Discrete mathematics. 1992, Vol 100, Num 1-3, pp 229-233, issn 0012-365XArticle

Three new distance-regular graphsSOICHER, L. H.European journal of combinatorics. 1993, Vol 14, Num 5, pp 501-505, issn 0195-6698Article

A remark on branched cyclic coversHILLMAN, J. A.Journal of pure and applied algebra. 1993, Vol 87, Num 3, pp 237-240, issn 0022-4049Article

The vertex-cover polynomial of a graphDONG, F. M; HENDY, M. D; TEO, K. L et al.Discrete mathematics. 2002, Vol 250, Num 1-3, pp 71-78, issn 0012-365XArticle

More coverings by rook domainsBLOKHUIS, A; LAM, C. W. H.Journal of combinatorial theory. Series A. 1984, Vol 36, Num 2, pp 240-244, issn 0097-3165Article

Covering simply connected regions by rectanglesGYORI, E.Combinatorica (Print). 1985, Vol 5, Num 1, pp 53-55, issn 0209-9683Article

A covering theorem for simplexesSIES, H.Journal of mathematical analysis and applications. 1984, Vol 98, Num 2, pp 599-602, issn 0022-247XArticle

On dimer coverings of rectangles of fixed widthSTANLEY, R. P.Discrete applied mathematics. 1985, Vol 12, Num 1, pp 81-87, issn 0166-218XArticle

Families of wildly ramified covers of curvesPRIES, Rachel J.American journal of mathematics (Print). 2002, Vol 124, Num 4, pp 737-768, issn 0002-9327Article

Rareté des intervalles recouvrant un point dans un recouvrement aléatoire = Scarcity of point covering intervals in random coverageAI HUA FAN; KAHANE, J.-P.Annales de l'I.H.P. Probabilités et statistiques. 1993, Vol 29, Num 3, pp 453-466, issn 0246-0203Article

An Erdös-Gallai conjecturePYBER, L.Combinatorica (Print). 1985, Vol 5, Num 1, pp 67-79, issn 0209-9683Article

On cycle double covers of line graphsCAI, L; CORNEIL, D.Discrete mathematics. 1992, Vol 102, Num 1, pp 103-106, issn 0012-365XArticle

Recouvrements d'espaces de Hamming binaires = Coverings of binary Hamming spacesLOBSTEIN, A; COHEN, G; SLOANE, N. J. A et al.Comptes rendus de l'Académie des sciences. Série 1, Mathématique. 1985, Vol 301, Num 5, pp 135-138, issn 0764-4442Article

Covering properties of simplexesIDZIK, A; TAN, K.-K.Journal of mathematical analysis and applications. 1993, Vol 176, Num 2, pp 608-616, issn 0022-247XArticle

Methods of finding all minimum coverings of a graph by cliquesBRATTSEVA, YE. V; CHERENIN, V. P.Computational mathematics and mathematical physics. 1994, Vol 34, Num 8-9, pp 1103-1118, issn 0965-5425Article

Piecewise linear discontinuous double coverings of the circleGALEEVA, R; TRESSER, C.Proceedings of the American Mathematical Society. 1993, Vol 118, Num 1, pp 285-291, issn 0002-9939Article

Short cycle covers and the cycle double cover conjectureJAMSHY, U; TARSI, M.Journal of combinatorial theory. Series B. 1992, Vol 56, Num 2, pp 197-204, issn 0095-8956Article

The medial graph and voltage-current dualityARCHDEACON, D.Discrete mathematics. 1992, Vol 104, Num 2, pp 111-141, issn 0012-365XArticle

On 3-connected graphs with contractible edge covers of size kHEMMINGER, R. L; XINGXING YU.Discrete mathematics. 1992, Vol 101, Num 1-3, pp 115-133, issn 0012-365XArticle

On some covering designsTODOROV, D. T.Journal of combinatorial theory. Series A. 1985, Vol 39, Num 1, pp 83-101, issn 0097-3165Article

An approximation algorithm for the minimum latency set cover problemHASSIN, Refael; LEVIN, Asaf.Lecture notes in computer science. 2005, pp 726-733, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 8 p.Conference Paper

  • Page / 487