On the Decomposition of Graphs (Q3964612): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On partitions of graphs into trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3312268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the coverings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Representation of a Graph by Set Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Addressing Problem for Loop Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Katona and Tarjan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5547602 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5525916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5334622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5539649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank

Latest revision as of 16:26, 13 June 2024

scientific article
Language Label Description Also known as
English
On the Decomposition of Graphs
scientific article

    Statements

    On the Decomposition of Graphs (English)
    0 references
    1981
    0 references
    decompositions into edge-disjoint subgraphs
    0 references
    complete graphs
    0 references
    complete bipartite graph
    0 references
    0 references

    Identifiers