scientific article; zbMATH DE number 7731161

zbMATH Open1519.05132arXiv2008.02410MaRDI QIDQ6134934FDOQ6134934

S. Mafunda, Paul Horn, Matthew Devilbiss, K. E. Perry, Bradley Fain, Author name not available (Why is that?)

Publication date: 23 August 2023

Full work available at URL: https://arxiv.org/abs/2008.02410

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

JL-coloringsKirchoff's matrix tree theorem

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Edge-disjoint rainbow spanning trees in complete graphs
• Rainbow spanning trees in complete graphs colored by one‐factorizations
• Multicolored trees in complete graphs
• Title not available (Why is that?)
• On the number of rainbow spanning trees in edge-colored complete graphs
• Linearly many rainbow trees in properly edge-coloured complete graphs
• Decompositions into spanning rainbow structures
• On rainbow-cycle-forbidding edge colorings of finite graphs
• Decompositions into isomorphic rainbow spanning trees
• Title not available (Why is that?)
• Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles

Cited In (1)

• Rainbow spanning trees in complete graphs colored by one‐factorizations

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)