{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T20:23:03Z","timestamp":1775506983144,"version":"3.50.1"},"reference-count":12,"publisher":"EDP Sciences","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1979]]},"DOI":"10.1051\/ita\/1979130100031","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T10:46:04Z","timestamp":1486377964000},"page":"3-18","source":"Crossref","is-referenced-by-count":40,"title":["Nombre de sauts et graphes s\u00e9rie-parall\u00e8les"],"prefix":"10.1051","volume":"13","author":[{"given":"O.","family":"Cogis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Habib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. CHATY G., CHEIN M., MARTIN P. et PETOLLA G., Some Results About the Number of Jumps of an Acircuit Digraph, Proc. 5th. S-E Conf. Combinatorics, Graph Theory and Computing, p. 267-279, Winnipeg, Utilitas Math., 1974.3603380311.05116"},{"key":"R2","unstructured":"2. CHATY G., CHEIN M., MARTIN P. et PETOLLA G., Number of Jumps and Ordered Matchings in Bipartite Digraphs (\u00e0 para\u00eetre).0324.68023"},{"key":"R3","unstructured":"3. CHEIN M. et MARTIN P., Sur le nombre de sauts d'une for\u00eat, C. R. Acad. Sc. Paris, t. 275, s\u00e9rie A, 1972, p. 159-161.3024890237.05107"},{"key":"R4","unstructured":"4. DUCAMP A., Sur la dimension d'un ordre partiel, Th\u00e9orie des graphes, Journ\u00e9es internationales d'\u00e9tude, Rome, 1967, Dunod, Paris, p. 103-112.2206320214.23304"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5. ELGOT C. C. et WRIGHT J. E., Series-Parallel Graphs and Lattices, Duke Math. J.,vol. 26, 1959, p. 325-338.1052750086.16303","DOI":"10.1215\/S0012-7094-59-02631-6"},{"key":"R6","unstructured":"6. HABIB M., Partitions en chemins des sommets et sauts dans les graphes sans circuit, Th\u00e8se de 3e cycle, Universit\u00e9 Paris-VI, 1975."},{"key":"R7","unstructured":"7. JOLIVET J. L., Probl\u00e8mes de connexit\u00e9 et probl\u00e8mes hamiltoniens en th\u00e9orie des graphes. Joint d'une famille de graphes et g\u00e9n\u00e9ralisation de la notion de graphe parfait, Th\u00e8se Sc. Math., Universit\u00e9 Paris-VI, 1975."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. KROGDALH S., The Dependance Graph for Basis in Matroids, Discrete Math., vol.19, 1977, p. 47-59.5436590366.05024","DOI":"10.1016\/0012-365X(77)90118-2"},{"key":"R9","unstructured":"9. LAWLER E. L. et TARJAN R. E., Analysis and Isomorphism of Serie-Parallel Digraph (\u00e0 para\u00eetre)."},{"key":"R10","unstructured":"10. LAWLER E. L., Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints, Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, Orsay, 1976.0374.68033503698"},{"key":"R11","unstructured":"11. MONTJARDET B., Probl\u00e8mes de transversalit\u00e9 dans les hypergraphes, les ensembles ordonn\u00e9s et en th\u00e9orie de la d\u00e9cision collective, Th\u00e8se Sc. Math., Universit\u00e9 Paris-VI, 1974."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. SABIDUSSI G., Graph Derivative, Math. Zeitschr., vol. 76, 1961, p. 385-401.1699651301860109.16404","DOI":"10.1007\/BF01210984"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1979130100031\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:36:22Z","timestamp":1568784982000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1979130100031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":12,"journal-issue":{"issue":"1"},"alternative-id":["ita1979130100031"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1979130100031","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}