Partitions of multigraphs without \(C_4\)

DOI10.1007/s00373-021-02335-4zbMath1483.05132OpenAlexW3168636084MaRDI QIDQ2053675

Jialei Song, Bao-Gang Xu

Publication date: 30 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02335-4

zbMATH Keywords

partitiondegree constraintssubgraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)

Related Items (2)

On a conjecture of Schweser and Stiebitz ⋮ On connected partition with degree constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Partition of graphs with condition on the connectivity and minimum degree
• Efficient algorithms for decomposing graphs under degree constraints
• Partitions of multigraphs under minimum degree constraints
• On partitions of \(K_{2, 3}\)-free graphs under degree constraints
• Partitions of graphs and multigraphs under degree constraints
• A note on partitions of graphs under degree constraints
• On partitions of graphs under degree constraints
• On a conjecture of Schweser and Stiebitz
• Graph decomposition with constraints on the connectivity and minimum degree
• On decomposition of triangle-free graphs under degree constraints
• Decomposing graphs with girth at least five under degree constraints
• Decomposing Weighted Graphs
• Decomposing C₄‐free graphs under degree constraints

This page was built for publication: Partitions of multigraphs without \(C_4\)