Decomposing graphs with girth at least five under degree constraints

From MaRDI portal
Publication:4948751

DOI<237::AID-JGT4>3.0.CO;2-A 10.1002/(SICI)1097-0118(200004)33:4<237::AID-JGT4>3.0.CO;2-AzbMath0942.05055OpenAlexW4249559114MaRDI QIDQ4948751

Ajit A. Diwan

Publication date: 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(200004)33:4<237::aid-jgt4>3.0.co;2-a




Related Items (26)

On partitions of graphs under degree constraintsDegree-constrained decompositions of graphs: Bounded treewidth and planarityVertex-disjoint subgraphs with high degree sumsOn a conjecture of Schweser and StiebitzOn connected partition with degree constraintsEfficient algorithms for decomposing graphs under degree constraintsComplexity and Kernels for Bipartition into Degree-bounded Induced GraphsPartitions of graphs and multigraphs under degree constraintsDisjoint cycles of different lengths in graphs and digraphsA note on partitions of graphs under degree constraintsGraph partitioning: an updated surveyA note on internal partitions: the 5-regular case and beyondOn the existence of vertex-disjoint subgraphs with high degree sumGraph partitions under average degree constraintDegree conditions for the existence of vertex-disjoint cycles and paths: a surveyPartitions of multigraphs under minimum degree constraintsSatisfactory graph partition, variants, and generalizationsA generalization of Stiebitz-type results on graph decompositionComplexity and kernels for bipartition into degree-bounded induced graphsBipartition of graph under degree constraintsOn partitions of \(K_{2, 3}\)-free graphs under degree constraintsPartitions of multigraphs without \(C_4\)Asymptotically almost every \(2r\)-regular graph has an internal partitionPartitioning a graph into alliance free setsA NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPHA Relaxed Version of the Erdős–Lovász Tihany Conjecture




This page was built for publication: Decomposing graphs with girth at least five under degree constraints