Sharp bounds for decompositions of graphs into completer-partite subgraphs
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199604)21:4<393::AID-JGT4>3.0.CO;2-K" /><393::AID-JGT4>3.0.CO;2-K 10.1002/(SICI)1097-0118(199604)21:4<393::AID-JGT4>3.0.CO;2-KzbMath0856.05081OpenAlexW4235787092MaRDI QIDQ4879175
Kevin N. Vander Meulen, David A. Gregory
Publication date: 8 July 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199604)21:4<393::aid-jgt4>3.0.co;2-k
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (6)
This page was built for publication: Sharp bounds for decompositions of graphs into completer-partite subgraphs