Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

\(K_{1,k}\)-factorization of complete bipartite graphs

From MaRDI portal
Publication:1861224
Jump to:navigation, search

DOI10.1016/S0012-365X(02)00587-3zbMath1013.05063OpenAlexW2038028400MaRDI QIDQ1861224

Jian Wang, Beiliang Du

Publication date: 16 March 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00587-3


zbMATH Keywords

partitioncomplete bipartite graphfactorizationfactor


Mathematics Subject Classification ID

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


Related Items (7)

The proof of Ushio's conjecture concerning path factorization of complete bipartite graphs ⋮ Star-factorization of the complete bipartite multigraphs ⋮ On \(K_{p,q}\)-factorization of complete bipartite multigraphs ⋮ Unbalanced star-factorizations of complete bipartite graphs. II ⋮ On \(K_{1,k}\)-factorization of bipartite multigraphs ⋮ Unbalanced star-factorisations of complete bipartite graphs ⋮ Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles




This page was built for publication: \(K_{1,k}\)-factorization of complete bipartite graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1861224&oldid=14249992"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:27.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki