Minimum rainbow \(H\)-decompositions of graphs

DOI10.1016/j.ejc.2018.03.002zbMath1387.05210OpenAlexW2962698328MaRDI QIDQ5916053

Lale Özkahya, Yury Person

Publication date: 18 May 2018

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2018.03.002

zbMATH Keywords

properly edge-colored graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Minimum \(H\)-decompositions of graphs: edge-critical case
• On the KŁR conjecture in random graphs
• An improved error term for minimum \(H\)-decompositions of graphs
• Asymptotic behavior of the chromatic index for hypergraphs
• On a packing and covering problem
• On the number of edge disjoint cliques in graphs of given size
• Minimum \(H\)-decompositions of graphs
• Decompositions of graphs into 5-cycles and other small graphs
• Rainbow Turán Problems
• Monochromatic Clique Decompositions of Graphs
• On complete subgraphs of different orders
• Monochromatic K_r‐Decompositions of Graphs
• The Representation of a Graph by Set Intersections
• On the structure of linear graphs
• Concentration of multivariate polynomials and its applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum rainbow \(H\)-decompositions of graphs