Packing complete multipartite graphs with 4-cycles
| Contribuinte(s) |
P. Seymour |
|---|---|
| Data(s) |
05/02/2001
|
| Resumo |
In this paper we completely solve the problem of finding a maximum packing of any complete multipartite graph with edge-disjoint 4-cycles, and the minimum leaves are explicitly given. |
| Identificador | |
| Idioma(s) |
eng |
| Publicador |
John Wiley & Sons, Inc. |
| Palavras-Chave | #Complete multipartite graphs #230101 Mathematical Logic, Set Theory, Lattices And Combinatorics |
| Tipo |
Journal Article |
