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

DOI10.1016/0012-365X(95)00157-RzbMATH Open0860.05058MaRDI QIDQ1126293FDOQ1126293

C. A. Rodger, D. G. Hoffman

Publication date: 14 January 1997

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

Recommendations

• Publication:3487420
• On the edge-disjoint 1-factors in the power of connected graphs
• On \(K_{1,k}\)-factorizations of a complete bipartite graph
• scientific article; zbMATH DE number 26496
• \(K_{1,k}\)-factorization of complete bipartite graphs
• scientific article; zbMATH DE number 7448387
• On \(K_{1,k}\)-factorization of bipartite multigraphs
• Edge-disjoint 1-factors in powers of connected graphs
• \(K_{1,p^k}\)-factorization of complete bipartite graphs
• The multiplicity of 1-factors in total graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Packing arrays
• Title not available (Why is that?)
• On 2-factors with a bounded number of odd components
• Title not available (Why is that?)
• On minimum sets of 1-factors covering a complete multipartite graph
• Graph factors and factorization: 1985--2003: a survey
• On the minimum number of edge‐disjoint complete m‐partite subgraphs into which K_n can be decomposed

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1126293)