Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Factorization of complete graphs into long double brooms

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

zbMATH Open1218.05131MaRDI QIDQ2995162FDOQ2995162


Authors: Dalibor Fronček, Mariusz Meszka Edit this on Wikidata


Publication date: 20 April 2011





Recommendations

  • Factorizations of complete graphs into brooms
  • On double-star decomposition of graphs
  • scientific article; zbMATH DE number 4150220
  • Two-fold factorization of the complete bipartite graphs by infinite graph classes
  • On decomposing regular graphs into isomorphic double-stars


zbMATH Keywords

graph factorizationgraph labeling


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)



Cited In (1)

  • Factorizations of complete graphs into brooms





This page was built for publication: Factorization of complete graphs into long double brooms

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2995162&oldid=16008473"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:07. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki