The spectrum of optimal excess graphs for trees with up to four edges
From MaRDI portal
Publication:2176155
DOI10.1016/J.AKCEJ.2018.06.001zbMATH Open1439.05135OpenAlexW2810679563MaRDI QIDQ2176155FDOQ2176155
Danny Dyer, Sadegheh Haghshenas, Nabil Shalaby
Publication date: 4 May 2020
Published in: AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.akcej.2018.06.001
Recommendations
- Constructing the spectrum for packings of the complete graph with trees that have up to five edges
- scientific article; zbMATH DE number 3963853
- scientific article; zbMATH DE number 3924794
- Packing and decomposition of graphs with trees
- Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges
Cites Work
- Title not available (Why is that?)
- Packing and covering of the complete graph with a graph G of four vertices or less
- The packing and covering of the complete graph. I: The forests of order five
- Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On DRC‐covering of Kn by cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: The spectrum of optimal excess graphs for trees with up to four edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176155)
