Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("JARIK SI")

Document Type [dt]

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

Discipline (document) [di]

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

Author Country

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

Results 1 to 15 of 15

  • Page / 1
Export

Selection :

  • and

LOCUS CERULEUS LESION AND CHRONIC RESERPINE TREATMENT EFFECT ON ADRENERGIC AND CHOLINERGIC RECEPTORS IN CEREBRAL CORTEX AND HIPPOCAMPUSSHARMA VK; JARIK SI; GANAPATHI M et al.1979; EXPER. NEUROL.; USA; DA. 1979; VOL. 65; NO 3; PP. 685-690; BIBL. 12 REF.Article

Packing non-returning A-paths algorithmicallyPAP, Gyula.Discrete mathematics. 2008, Vol 308, Num 8, pp 1472-1488, issn 0012-365X, 17 p.Conference Paper

Third European Conference on Combinatorics, Graph Theory and ApplicationsFELSNER, Stefan; LÜBBECKE, Marco; NESETRIL, Jarik et al.Discrete mathematics. 2008, Vol 308, Num 8, issn 0012-365X, 145 p.Conference Proceedings

On the minimum number of completely 3-scrambling permutationsTARUI, Jun.Discrete mathematics. 2008, Vol 308, Num 8, pp 1350-1354, issn 0012-365X, 5 p.Conference Paper

Matroid matching with Dilworth truncationMAKAI, Marton.Discrete mathematics. 2008, Vol 308, Num 8, pp 1394-1404, issn 0012-365X, 11 p.Conference Paper

On the L(p, 1)-labelling of graphsGONCALVES, D.Discrete mathematics. 2008, Vol 308, Num 8, pp 1405-1414, issn 0012-365X, 10 p.Conference Paper

Breaking the rhythm on graphsALON, Noga; GRYTCZUK, Jaroslaw.Discrete mathematics. 2008, Vol 308, Num 8, pp 1375-1380, issn 0012-365X, 6 p.Conference Paper

Packing triangles in low degree graphs and indifference graphsMANIC, Gordana; WAKABAYASHI, Yoshiko.Discrete mathematics. 2008, Vol 308, Num 8, pp 1455-1471, issn 0012-365X, 17 p.Conference Paper

Pebble game algorithms and sparse graphsLEE, Audrey; STREINU, Ileana.Discrete mathematics. 2008, Vol 308, Num 8, pp 1425-1437, issn 0012-365X, 13 p.Conference Paper

Distance graphs with maximum chromatic numberBARAJAS, Javier; SERRA, Oriol.Discrete mathematics. 2008, Vol 308, Num 8, pp 1355-1365, issn 0012-365X, 11 p.Conference Paper

Series-parallel graphs are windy postman perfectZARAGOZA MARTINEZ, Francisco Javier.Discrete mathematics. 2008, Vol 308, Num 8, pp 1366-1374, issn 0012-365X, 9 p.Conference Paper

The game of arboricityBARTNICKI, T; GRYTCZUK, J. A; KIERSTEAD, H. A et al.Discrete mathematics. 2008, Vol 308, Num 8, pp 1388-1393, issn 0012-365X, 6 p.Conference Paper

Representing edge intersection graphs of paths on degree 4 treesGOLUMBIC, Martin Charles; LIPSHTEYN, Marina; STERN, Michal et al.Discrete mathematics. 2008, Vol 308, Num 8, pp 1381-1387, issn 0012-365X, 7 p.Conference Paper

Extremal k-edge-hamiltonian hypergraphsFRANKL, Péter; KATONA, Gyula Y.Discrete mathematics. 2008, Vol 308, Num 8, pp 1415-1424, issn 0012-365X, 10 p.Conference Paper

Improper colouring of (random) unit disk graphsKANG, Ross J; MULLER, Tobias; SERENI, Jean-Sébastien et al.Discrete mathematics. 2008, Vol 308, Num 8, pp 1438-1454, issn 0012-365X, 17 p.Conference Paper

  • Page / 1