Restricted cycle factors and arc-decompositions of digraphs (Q2354716): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.dam.2015.04.020 / rank | |||
Property / author | |||
Property / author: Jörgen Bang-Jensen / rank | |||
Property / author | |||
Property / author: Jörgen Bang-Jensen / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1659291953 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the problem of finding disjoint cycles and dicycles in a digraph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vertex-disjoint directed and undirected cycles in general digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4796188 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On avoiding some families of arrays / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: NP completeness of the edge precoloring extension problem on bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding maximum square-free 2-matchings in bipartite graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5530472 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4273847 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DAM.2015.04.020 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:12, 18 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Restricted cycle factors and arc-decompositions of digraphs |
scientific article |
Statements
Restricted cycle factors and arc-decompositions of digraphs (English)
0 references
24 July 2015
0 references
cycle factor
0 references
2-factor
0 references
mixed problem
0 references
NP-complete
0 references
complexity
0 references
cycle factors with no short cycles
0 references
Latin square
0 references
avoidable arrays
0 references
monochromatic matchings
0 references