Partitioning graphs with linear minimum degree

DOI10.1002/RSA.21238MaRDI QIDQ6623579

Jie Ma, Hehui Wu

Publication date: 24 October 2024

Published in: Random Structures \& Algorithms (Search for Journal in Brave)

zbMATH Keywords

minimum degree\(f\)-factorgraph partitionOre's theoremquestion of Kühn-Osthus

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Partition of graphs with condition on the connectivity and minimum degree
• Partitions of graphs with high minimum degree or connectivity.
• The extremal function for disconnected minors
• Graphs and Subgraphs
• Graph decomposition with constraints on the connectivity and minimum degree
• On Representatives of Subsets
• The Factors of Graphs

This page was built for publication: Partitioning graphs with linear minimum degree

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