On decomposition of triangle-free graphs under degree constraints

DOI10.1002/(SICI)1097-0118(199801)27:1%3C7::AID-JGT2%3E3.0.CO;2-UzbMATH Open0892.05040OpenAlexW4256209269MaRDI QIDQ4376499FDOQ4376499

Authors: Atsushi Kaneko 

Publication date: 27 July 1998

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199801)27:1%3C7::aid-jgt2%3E3.0.co;2-u

Recommendations

• scientific article; zbMATH DE number 944226
• On path-cycle decompositions of triangle-free graphs
• Decomposing \(C_4\)-free graphs under degree constraints
• Path decompositions of triangle-free graphs
• Decomposition of graphs with constraint on minimum degree
• Decomposition of bipartite graphs under degree constraints
• Maximal triangle‐free graphs with restrictions on the degrees
• On degree sums of a triangle-free graph

Mathematics Subject Classification ID

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

Cited In (36)

• Decomposing \(C_4\)-free graphs under degree constraints
• Internal partitions of regular graphs
• Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
• Graph decompositions without isolated vertices III
• On partitions of graphs under degree constraints
• Almost-spanning subgraphs with bounded degree in dense graphs
• Improper C-colorings of graphs
• Triangle-free circuit decompositions and Petersen minor
• A relaxed version of the Erdős-Lovász Tihany conjecture
• Graph partitioning: an updated survey
• Complexity and kernels for bipartition into degree-bounded induced graphs
• Degree-constrained 2-partitions of graphs
• A generalization of Stiebitz-type results on graph decomposition
• On a conjecture of Schweser and Stiebitz
• A note on almost balanced bipartitions of a graph
• Partitions of graphs and multigraphs under degree constraints
• Vertex-disjoint subgraphs with high degree sums
• Graph partitions under average degree constraint
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Complexity and kernels for bipartition into degree-bounded induced graphs
• Partitioning a graph into alliance free sets
• On connected partition with degree constraints
• Efficient algorithms for decomposing graphs under degree constraints
• Satisfactory graph partition, variants, and generalizations
• Partitions of multigraphs without \(C_4\)
• On partitions of \(K_{2, 3}\)-free graphs under degree constraints
• Disjoint cycles of different lengths in graphs and digraphs
• Decomposition of graphs with constraint on minimum degree
• Partitions of multigraphs under minimum degree constraints
• Degree-constrained decompositions of graphs: Bounded treewidth and planarity
• Bipartition of graph under degree constraints
• On the existence of vertex-disjoint subgraphs with high degree sum
• Asymptotically almost every \(2r\)-regular graph has an internal partition
• A note on internal partitions: the 5-regular case and beyond
• Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization
• A note on partitions of graphs under degree constraints

This page was built for publication: On decomposition of triangle-free graphs under degree constraints

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