Combinatorial and computational aspects of graph packing and graph decomposition
- 1 August 2007
- journal article
- Published by Elsevier in Computer Science Review
- Vol. 1 (1) , 12-26
Abstract
No abstract availableKeywords
This publication has 62 references indexed in Scilit:
- Proof of the Alon–Yuster conjectureDiscrete Mathematics, 2001
- Blow-up LemmaCombinatorica, 1997
- Nearly-perfect hypergraph packing is in NCInformation Processing Letters, 1996
- Maximum bounded H-matching is MAX SNP-completeInformation Processing Letters, 1994
- Matching and covering the vertices of a random graph by copies of a given graphDiscrete Mathematics, 1992
- Decomposition of large combinatorial structuresArchiv der Mathematik, 1989
- Near Perfect Coverings in Graphs and HypergraphsEuropean Journal of Combinatorics, 1985
- On a Packing and Covering ProblemEuropean Journal of Combinatorics, 1985
- On circuits in graphsDiscrete Mathematics, 1984
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947