Arc-disjoint spanning sub(di)graphs in digraphs (Q441857): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Jörgen Bang-Jensen / rank
Normal rank
 
Property / author
 
Property / author: Jörgen Bang-Jensen / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6064141 / rank
 
Normal rank
Property / zbMATH Keywords
 
paths and cycles
Property / zbMATH Keywords: paths and cycles / rank
 
Normal rank
Property / zbMATH Keywords
 
branchings
Property / zbMATH Keywords: branchings / rank
 
Normal rank
Property / zbMATH Keywords
 
spanning trees
Property / zbMATH Keywords: spanning trees / rank
 
Normal rank
Property / zbMATH Keywords
 
NP-completeness
Property / zbMATH Keywords: NP-completeness / rank
 
Normal rank
Property / zbMATH Keywords
 
arc-disjoint subdigraphs
Property / zbMATH Keywords: arc-disjoint subdigraphs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039008368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing locally semicomplete digraphs into strong spanning subdigraphs / 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: Disjoint directed and undirected paths and cycles in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint sub(di)graphs in digraphs / 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: Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two minimax theorems in graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid theory and its applications in electric network theory and in statics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:34, 5 July 2024

scientific article
Language Label Description Also known as
English
Arc-disjoint spanning sub(di)graphs in digraphs
scientific article

    Statements

    Arc-disjoint spanning sub(di)graphs in digraphs (English)
    0 references
    0 references
    0 references
    8 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    paths and cycles
    0 references
    branchings
    0 references
    spanning trees
    0 references
    NP-completeness
    0 references
    arc-disjoint subdigraphs
    0 references
    0 references