On decomposition of triangle-free graphs under degree constraints

DOI<7::AID-JGT2>3.0.CO;2-U 10.1002/(SICI)1097-0118(199801)27:1<7::AID-JGT2>3.0.CO;2-UzbMath0892.05040OpenAlexW4256209269MaRDI QIDQ4376499

Atsushi Kaneko

Publication date: 27 July 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199801)27:1<7::aid-jgt2>3.0.co;2-u

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

On partitions of graphs under degree constraints, Degree-constrained decompositions of graphs: Bounded treewidth and planarity, Vertex-disjoint subgraphs with high degree sums, On a conjecture of Schweser and Stiebitz, On connected partition with degree constraints, Efficient algorithms for decomposing graphs under degree constraints, Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs, Partitions of graphs and multigraphs under degree constraints, Disjoint cycles of different lengths in graphs and digraphs, Degree-constrained 2-partitions of graphs, A note on partitions of graphs under degree constraints, Graph partitioning: an updated survey, A note on internal partitions: the 5-regular case and beyond, On the existence of vertex-disjoint subgraphs with high degree sum, Improper C-colorings of graphs, Graph partitions under average degree constraint, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Partitions of multigraphs under minimum degree constraints, Satisfactory graph partition, variants, and generalizations, Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization, A generalization of Stiebitz-type results on graph decomposition, Complexity and kernels for bipartition into degree-bounded induced graphs, Bipartition of graph under degree constraints, On partitions of \(K_{2, 3}\)-free graphs under degree constraints, Partitions of multigraphs without \(C_4\), Asymptotically almost every \(2r\)-regular graph has an internal partition, Internal Partitions of Regular Graphs, Partitioning a graph into alliance free sets, A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH, Almost-spanning subgraphs with bounded degree in dense graphs, A Relaxed Version of the Erdős–Lovász Tihany Conjecture