scientific article; zbMATH DE number 7731161
From MaRDI portal
Publication:6134934
Recommendations
- On the number of rainbow spanning trees in edge-colored complete graphs
- Edge-disjoint rainbow spanning trees in complete graphs
- Rainbow spanning trees in properly coloured complete graphs
- \((g,f)\)-chromatic spanning trees and forests
- Rainbow spanning trees in complete graphs colored by one‐factorizations
Cites work
- scientific article; zbMATH DE number 5995288 (Why is no real title available?)
- scientific article; zbMATH DE number 3395950 (Why is no real title available?)
- Decompositions into isomorphic rainbow spanning trees
- Decompositions into spanning rainbow structures
- Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles
- Edge-disjoint rainbow spanning trees in complete graphs
- Linearly many rainbow trees in properly edge-coloured complete graphs
- Multicolored trees in complete graphs
- On rainbow-cycle-forbidding edge colorings of finite graphs
- On the number of rainbow spanning trees in edge-colored complete graphs
- Rainbow spanning trees in complete graphs colored by one‐factorizations
Cited in
(2)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134934)