Vertex-disjoint subgraphs with high degree sums

DOI10.1016/J.ENDM.2015.06.050zbMATH Open1346.05035OpenAlexW2177103137MaRDI QIDQ322265FDOQ322265

Authors: Shuya Chiba, Nicolas Lichiardopol 

Publication date: 14 October 2016

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

Recommendations

• On the existence of vertex-disjoint subgraphs with high degree sum
• Degree sum conditions on two disjoint cycles in graphs
• Degree sum conditions and vertex-disjoint cycles in a graph
• On vertex-disjoint cycles and degree sum conditions
• Degree sum conditions for vertex-disjoint cycles passing through specified vertices

zbMATH Keywords

decompositionsminimum degree sumvertex-disjoint subgraphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Partitions of graphs with high minimum degree or connectivity.
• Graphs with a cycle of length divisible by three
• Title not available (Why is that?)
• Vertex-disjoint subgraphs with high degree sums
• Title not available (Why is that?)
• Title not available (Why is that?)
• An El-Zah�r type condition ensuring path-factors
• On decomposition of triangle-free graphs under degree constraints
• Title not available (Why is that?)
• Decomposing graphs with girth at least five under degree constraints
• Multiply Chorded Cycles
• A note on a cycle partition problem
• The path partition conjecture is true for claw-free graphs

Cited In (3)

• Disjoint subgraphs of large maximum degree
• Vertex-disjoint subgraphs with high degree sums
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322265)