Decomposing large graphs with small graphs of high density

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199909)32:1<27::AID-JGT3>3.0.CO;2-C" /><27::AID-JGT3>3.0.CO;2-C 10.1002/(SICI)1097-0118(199909)32:1<27::AID-JGT3>3.0.CO;2-CzbMath0931.05071OpenAlexW4254533627MaRDI QIDQ4265585

Raphael Yuster

Publication date: 23 February 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199909)32:1<27::aid-jgt3>3.0.co;2-c

zbMATH Keywords

decompositiondensity

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item

This page was built for publication: Decomposing large graphs with small graphs of high density