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-AzbMATH Open0942.05055OpenAlexW4249559114MaRDI QIDQ4948751FDOQ4948751

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

Recommendations

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

zbMATH Keywords

decompositionminimum degreegirth

Mathematics Subject Classification ID

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

Cited In (28)

• Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs
• On partitions of graphs under degree constraints
• A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH
• Title not available (Why is that?)
• 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
• 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
• 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
• 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
• 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
• A Relaxed Version of the Erdős–Lovász Tihany Conjecture
• A note on partitions of graphs under degree constraints

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)