Some algorithmic results for finding compatible spanning circuits in edge-colored graphs

Location
Deutsche Nationalbibliothek Frankfurt am Main
ISSN
1573-2886
Extent
Online-Ressource
Language
Englisch
Notes
online resource.

Bibliographic citation
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs ; day:4 ; month:9 ; year:2020 ; pages:1-12
Journal of combinatorial optimization ; (4.9.2020), 1-12

Creator
Guo, Zhiwei
Broersma, Hajo
Li, Ruonan
Zhang, Shenggui
Contributor
SpringerLink (Online service)

DOI
10.1007/s10878-020-00644-7
URN
urn:nbn:de:101:1-2020102519524757523160
Rights
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
Last update
15.08.2025, 7:33 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Associated

  • Guo, Zhiwei
  • Broersma, Hajo
  • Li, Ruonan
  • Zhang, Shenggui
  • SpringerLink (Online service)

Other Objects (12)