Finding complementary cycles in locally semicomplete digraphs

Gespeichert in:
Bibliographische Detailangaben
Titel: Finding complementary cycles in locally semicomplete digraphs
Autoren: Bang-Jensen, Jørgen, Nielsen, Morten Hegner
Quelle: Bang-Jensen, J & Nielsen, M H 2005, ' Finding complementary cycles in locally semicomplete digraphs ', Discrete Applied Mathematics, vol. 146, pp. 245-256 . https://doi.org/10.1016/j.dam.2004.10.002
Verlagsinformationen: Elsevier BV, 2005.
Publikationsjahr: 2005
Schlagwörter: Semicomplete digraph, Applied Mathematics, Polynomial algorithm, 0211 other engineering and technologies, Directed graphs (digraphs), tournaments, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Graph theory (including graph drawing) in computer science, Complementary cycles, 2-Cycle factor, Discrete Mathematics and Combinatorics, Paths and cycles, Locally semicomplete digraph
Beschreibung: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Publikationsart: Article
Dateibeschreibung: application/xml
Sprache: English
ISSN: 0166-218X
DOI: 10.1016/j.dam.2004.10.002
Zugangs-URL: https://zbmath.org/2136335
https://doi.org/10.1016/j.dam.2004.10.002
https://core.ac.uk/display/82452721
https://dblp.uni-trier.de/db/journals/dam/dam146.html#Bang-JensenN05
https://www.sciencedirect.com/science/article/pii/S0166218X04003506
https://www.sciencedirect.com/science/article/abs/pii/S0166218X04003506
https://portal.findresearcher.sdu.dk/da/publications/44582030-e0ff-11db-9628-000ea68e967b
Rights: Elsevier Non-Commercial
Dokumentencode: edsair.doi.dedup.....6f5c804a72e5f0568162830e14f8b3be
Datenbank: OpenAIRE
Beschreibung
Abstract:zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ISSN:0166218X
DOI:10.1016/j.dam.2004.10.002