List decomposition of graphs.

DOI10.1016/S0012-365X(01)00051-6MaRDI QIDQ5957697zbMATH OpenFDO

Authors Yair Caro, Raphael Yuster

Publication date 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(01)00051-6

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1463402
• scientific article; zbMATH DE number 871167
• A graph theoretic division algorithm
• scientific article; zbMATH DE number 4012650
• Decompositions of graphs into trees

Cited in

(9)

• Packing closed trails into dense graphs.
• Decomposition of complete graphs into cycles and stars
• Decomposing dense bipartite graphs into 4-cycles
• An asymptotic existence result on compressed sensing matrices
• On a graph theoretic division algorithm and maximal decompositions of graphs
• A graph theoretic division algorithm
• Decomposing graphs of high minimum degree into 4-cycles
• Exact values for some unbalanced Zarankiewicz numbers
• Decompositions into 2-regular subgraphs and equitable partial cycle decompositions

This page was built for publication: List decomposition of graphs.

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