Enclosings of decompositions of complete multigraphs in 2-edge-connected r -factorizations

John Asplund; Pierre Charbit; Carl Feghali

doi:10.1016/j.disc.2019.04.021

Journal Articles Discrete Mathematics Year : 2019

Enclosings of decompositions of complete multigraphs in 2-edge-connected r -factorizations

(1) , (2, 3) , (4)

1
2
3
4

John Asplund

Function : Author

Dalton State College

Pierre Charbit

Function : Author
PersonId : 2046
IdHAL : pierre-charbit
ORCID : 0000-0001-9401-040X
IdRef : 242546285

Institut de Recherche en Informatique Fondamentale

Networks, Graphs and Algorithms

CV

Carl Feghali

Function : Author

University of Bergen

Domains

Computer Science [cs] Discrete Mathematics [cs.DM] Computer Science [cs] Data Structures and Algorithms [cs.DS] Mathematics [math] Combinatorics [math.CO] Computer Science [cs] Computational Geometry [cs.CG]

Pierre Charbit : Connect in order to contact the contributor

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

Submitted on : Monday, January 6, 2020-3:18:00 PM

Last modification on : Friday, November 18, 2022-9:24:39 AM

Dates and versions

hal-02429274 , version 1 (06-01-2020)

Identifiers

HAL Id : hal-02429274 , version 1
DOI : 10.1016/j.disc.2019.04.021

Cite

John Asplund, Pierre Charbit, Carl Feghali. Enclosings of decompositions of complete multigraphs in 2-edge-connected r -factorizations. Discrete Mathematics, 2019, 342 (8), pp.2195-2203. ⟨10.1016/j.disc.2019.04.021⟩. ⟨hal-02429274⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

UNIV-PARIS7 CNRS INRIA INSMI INRIA2 TDS-MACS USPC UNIV-PARIS UP-SCIENCES IRIF

25 View

0 Download

Enclosings of decompositions of complete multigraphs in 2-edge-connected r -factorizations

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share