Vertex-disjoint subgraphs with high degree sums
From MaRDI portal
(Redirected from Publication:322265)
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
Cites work
- scientific article; zbMATH DE number 4164908 (Why is no real title available?)
- scientific article; zbMATH DE number 4077268 (Why is no real title available?)
- scientific article; zbMATH DE number 944226 (Why is no real title available?)
- scientific article; zbMATH DE number 3243267 (Why is no real title available?)
- scientific article; zbMATH DE number 3344609 (Why is no real title available?)
- A degree sum condition for the existence of a path-factor.
- A note on a cycle partition problem
- An El-Zah�r type condition ensuring path-factors
- Decomposing graphs with girth at least five under degree constraints
- Graphs with a cycle of length divisible by three
- Multiply chorded cycles
- On decomposition of triangle-free graphs under degree constraints
- Partitions of graphs with high minimum degree or connectivity.
- The path partition conjecture is true for claw-free graphs
- Vertex-disjoint subgraphs with high degree sums
Cited in
(4)
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)
