Decomposition of complete graphs into forests with six edges
Saved in:
| Main Authors: | Bryan Freyberg, Ryan Peters |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2025-01-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Online Access: | https://www.dmgt.uz.zgora.pl/?doi=10.7151/dmgt.2554 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Similar Items
-
On the Ramsey Number for Theta Graphs Versus the Complete Graph of Order Six
by: A. Baniabedalruhman, et al.
Published: (2024-01-01) -
Solving Edges Deletion Problem of Complete Graphs
by: Anwar N. Jasim, et al.
Published: (2024-12-01) -
Decomposition of hypercube graphs into paths and cycles having k edges
by: D. Saranya, et al.
Published: (2025-05-01) -
On the Change of Distance Energy of Complete Bipartite Graph due to Edge Deletion
by: Shaowei Sun, et al.
Published: (2021-01-01) -
Notes on upper bounds for the largest eigenvalue based on edge-decompositions of a signed graph
by: Zoran Stanić
Published: (2023-07-01)