On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs

DOI10.1016/0012-365X(95)00157-RzbMath0860.05058MaRDI QIDQ1126293

C. A. Rodger, D. G. Hoffman

Publication date: 14 January 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

complete multipartite graph\(k\)-factor1-factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Graph factors and factorization: 1985--2003: a survey ⋮ Packing arrays ⋮ On 2-factors with a bounded number of odd components

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian decompositions of complete graphs
• Hamiltonian decompositions of complete regular s-partite graphs
• Amalgamations of almost regular edge-colourings of simple graphs
• Class one graphs
• 1-factorizing regular graphs of high degree - an improved bound
• Generalized latin rectangles I: Construction and decomposition
• Generalized latin rectangles. II: Embedding
• Graph factors
• The embedding of partial triple systems when 4 divides \(\lambda\)
• Méthode et théorème général de coloration des aretes d'un multigraphe
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• The chromatic index of complete multipartite graphs
• On A Particular Conference Scheduling Problem
• Embedding edge‐colorings into 2‐edge‐connected k‐factorizations of k_kn+1
• The Solution of a Timetabling Problem

This page was built for publication: On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs