Vertex-disjoint subgraphs with high degree sums (Q322265): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graphs with a cycle of length divisible by three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint subgraphs with high degree sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2936733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing graphs with girth at least five under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path partition conjecture is true for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiply Chorded Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5620621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An El-Zah�r type condition ensuring path-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of triangle-free graphs under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitions of graphs with high minimum degree or connectivity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5530470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a cycle partition problem / rank
 
Normal rank

Latest revision as of 17:26, 12 July 2024

scientific article
Language Label Description Also known as
English
Vertex-disjoint subgraphs with high degree sums
scientific article

    Statements

    Vertex-disjoint subgraphs with high degree sums (English)
    0 references
    0 references
    0 references
    14 October 2016
    0 references
    vertex-disjoint subgraphs
    0 references
    decompositions
    0 references
    minimum degree sum
    0 references

    Identifiers