Vertex-disjoint subgraphs with high degree sums

DOI10.1016/j.endm.2015.06.050zbMath1346.05035OpenAlexW2177103137MaRDI QIDQ322265

Shuya Chiba, Nicolas Lichiardopol

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.050

zbMATH Keywords

decompositionsminimum degree sumvertex-disjoint subgraphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Related Items (1)

Vertex-disjoint subgraphs with high degree sums

Cites Work

• Vertex-disjoint subgraphs with high degree sums
• A note on a cycle partition problem
• The path partition conjecture is true for claw-free graphs
• Graphs with a cycle of length divisible by three
• Partitions of graphs with high minimum degree or connectivity.
• [https://portal.mardi4nfdi.de/wiki/Publication:4242796 An El-Zah�r type condition ensuring path-factors]
• On decomposition of triangle-free graphs under degree constraints
• Decomposing graphs with girth at least five under degree constraints
• Multiply Chorded Cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Vertex-disjoint subgraphs with high degree sums