liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Restricted cycle factors and arc-decompositions of digraphs
University of Southern Denmark, Denmark.
Linköping University, Department of Mathematics, Mathematics and Applied Mathematics. Linköping University, Faculty of Science & Engineering.
2015 (English)In: Discrete Applied Mathematics, ISSN 0166-218X, E-ISSN 1872-6771, Vol. 193, 80-93 p.Article in journal (Refereed) Published
Abstract [en]

We study the complexity of finding 2-factors with various restrictions as well as edge-decompositions in (the underlying graphs of) digraphs. In particular we show that it is N P-complete to decide whether the underlying undirected graph of a digraph D has a 2-factor with cycles C-1, C-2, ..., C-k such that at least one of the cycles C-i is a directed cycle in D (while the others may violate the orientation back in D). This solves an open problem from J. Bang-Jensen et al., Vertex-disjoint directed and undirected cycles in general digraphs, JCT B 106 (2014), 1-14. Our other main result is that it is also N P-complete to decide whether a 2-edge-colored bipartite graph has two edge-disjoint perfect matchings such that one of these is monochromatic (while the other does not have to be). We also study the complexity of a number of related problems. In particular we prove that for every even k greater than= 2, the problem of deciding whether a bipartite digraph of girth k has a k-cycle-free cycle factor is N P-complete. Some of our reductions are based on connections to Latin squares and so-called avoidable arrays.

Place, publisher, year, edition, pages
Elsevier , 2015. Vol. 193, 80-93 p.
Keyword [en]
Cycle factor; 2-factor; Mixed problem; NP-complete; Complexity; Cycle factors with no short cycles; Latin square; Avoidable arrays; Monochromatic matchings
National Category
Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-120854DOI: 10.1016/j.dam.2015.04.020ISI: 000359174700007OAI: oai:DiVA.org:liu-120854DiVA: diva2:849475
Note

Funding Agencies|Danish Research Council [1323-00178B]; Institute Mittag-Leffler

Available from: 2015-08-28 Created: 2015-08-28 Last updated: 2017-12-04

Open Access in DiVA

fulltext(302 kB)51 downloads
File information
File name FULLTEXT01.pdfFile size 302 kBChecksum SHA-512
886f30e617b0fb6ece2b3ce63f95c99f6d94f7904fb4eca87d9f698db5449a7224884cbe0afd022b64c8c02420bae865f10558dd7b24a70aee299534e509e690
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Casselgren, Carl Johan

Search in DiVA

By author/editor
Casselgren, Carl Johan
By organisation
Mathematics and Applied MathematicsFaculty of Science & Engineering
In the same journal
Discrete Applied Mathematics
Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 51 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 112 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf