Balanced bipartite graphs may be completely star-factored

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6610(1997)5:6<407::AID-JCD2>3.0.CO;2-J" /><407::AID-JCD2>3.0.CO;2-J 10.1002/(SICI)1520-6610(1997)5:6<407::AID-JCD2>3.0.CO;2-JzbMath0912.05049OpenAlexW2111889992MaRDI QIDQ4221890

Nigel Martin

Publication date: 2 December 1998

Full work available at URL: https://doi.org/10.1002/(sici)1520-6610(1997)5:6<407::aid-jcd2>3.0.co;2-j

zbMATH Keywords

complete bipartite graphscomplete factorizations\(H\)-factorstar-factorizations

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (10)

Star factorizations of graph products ⋮ Star-factorization of the complete bipartite multigraphs ⋮ Unbalanced star-factorizations of complete bipartite graphs. II ⋮ Unbalanced bipartite factorizations of complete bipartite graphs ⋮ Complete bipartite factorisations of \(K _{n,n}\) ⋮ Unnamed Item ⋮ On \(K_{1,k}\)-factorization of bipartite multigraphs ⋮ Unbalanced star-factorisations of complete bipartite graphs ⋮ \(\widehat S_k\)-factorization of symmetric complete tripartite digraphs ⋮ Cycle-factorization of symmetric complete multipartite digraphs

This page was built for publication: Balanced bipartite graphs may be completely star-factored