Pierre Hansen, Alain Hertz
, Cherif Sellal, Damir Vukičević, Mustapha Aouchiche and Gilles Caporossi
Article (2017)
An external link is available for this item
| Department: | Department of Mathematics and Industrial Engineering |
|---|---|
| Research Center: | GERAD - Research Group in Decision Analysis |
| PolyPublie URL: | https://publications.polymtl.ca/39156/ |
| Journal Title: | Match-Communications in Mathematical and in Computer Chemistry (vol. 78, no. 3) |
| Official URL: | https://match.pmf.kg.ac.rs/electronic_versions/Mat... |
| Date Deposited: | 18 Apr 2023 15:04 |
| Last Modified: | 25 Sep 2024 16:24 |
| Cite in APA 7: | Hansen, P., Hertz, A., Sellal, C., Vukičević, D., Aouchiche, M., & Caporossi, G. (2017). Edge realizability of connected simple graphs. Match-Communications in Mathematical and in Computer Chemistry, 78(3), 689-712. https://match.pmf.kg.ac.rs/electronic_versions/Match78/n3/match78n3_689-712.pdf |
|---|---|
Statistics
Stats are not available on this system.
Repository Staff Only
|
View Item |
