Decomposition into two trees with orientation constraints (Q2339817): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047840586 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.3613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the degrees of the vertices of a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085455 / 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
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:16, 9 July 2024

scientific article
Language Label Description Also known as
English
Decomposition into two trees with orientation constraints
scientific article

    Statements

    Decomposition into two trees with orientation constraints (English)
    0 references
    9 April 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    spanning trees
    0 references
    graphs orientation
    0 references
    0 references
    0 references