Decomposing graphs with girth at least five under degree constraints

DOI10.1002/(SICI)1097-0118(200004)33:4%3C237::AID-JGT4%3E3.0.CO;2-AMaRDI QIDQ4948751zbMATH OpenOpenAlexFDO

Authors Ajit A. Diwan

Publication date 2000

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(200004)33:4%3C237::aid-jgt4%3E3.0.co;2-a

zbMATH Keywords

decompositionminimum degreegirth

Mathematics Subject Classification ID

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

Recommendations

• On decomposition of triangle-free graphs under degree constraints
• scientific article; zbMATH DE number 4014756
• Decomposing \(C_4\)-free graphs under degree constraints
• Decomposition of graphs with constraint on minimum degree

Cited in

(30)

• A note on partitions of graphs under degree constraints
• Decomposing \(C_4\)-free graphs under degree constraints
• On partitions of graphs under degree constraints
• scientific article; zbMATH DE number 2188395 (Why is no real title available?)
• 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
• A generalization of Stiebitz-type results on graph decomposition
• On a conjecture of Schweser and Stiebitz
• Vertex-disjoint subgraphs with high degree sums
• Partitions of graphs and multigraphs under degree constraints
• A note on almost balanced bipartitions of a graph
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Graph partitions under average degree constraint
• 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
• On the existence of vertex-disjoint subgraphs with high degree sum
• Bipartition of graph under degree constraints
• Graph decomposition with constraints in the minimum degree
• Asymptotically almost every \(2r\)-regular graph has an internal partition
• A note on internal partitions: the 5-regular case and beyond

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

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