Existence of Resolvable Path Designs

Jean-Claude Bermond; Katherine Heinrich; Min-Li Yu

doi:10.1016/S0195-6698(13)80120-5

Journal Articles European Journal of Combinatorics Year : 1990

Existence of Resolvable Path Designs

(1) , (2) , (2)

1
2

Jean-Claude Bermond

Function : Author
PersonId : 739520
IdHAL : jean-claude-bermond

Université Paris Sud Orsay

Katherine Heinrich

Function : Author

Simon Fraser University

Min-Li Yu

Function : Author

Simon Fraser University

Domains

Computer Science [cs] Discrete Mathematics [cs.DM] Computer Science [cs] Data Structures and Algorithms [cs.DS] Computer Science [cs] Networking and Internet Architecture [cs.NI] Computer Science [cs] Operations Research [cs.RO] Computer Science [cs] Social and Information Networks [cs.SI]

Fichier principal

75-BHY90-resovablepaths.pdf (2.48 Mo)

Origin : Files produced by the author(s)

Jean-Claude Bermond : Connect in order to contact the contributor

https://hal.inria.fr/hal-02974661

Submitted on : Wednesday, October 21, 2020-11:57:30 PM

Last modification on : Friday, October 7, 2022-3:47:35 AM

Long-term archiving on: Friday, January 22, 2021-7:29:38 PM

Dates and versions

hal-02974661 , version 1 (21-10-2020)

Identifiers

HAL Id : hal-02974661 , version 1
DOI : 10.1016/S0195-6698(13)80120-5

Cite

Jean-Claude Bermond, Katherine Heinrich, Min-Li Yu. Existence of Resolvable Path Designs. European Journal of Combinatorics, 1990, 11 (3), pp.205-211. ⟨10.1016/S0195-6698(13)80120-5⟩. ⟨hal-02974661⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

TDS-MACS UNIV-PARIS-SACLAY

10 View

51 Download

Existence of Resolvable Path Designs

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share