$(g,f)$-Chromatic spanning trees and forests

zbMath1419.05082arXiv1809.10355MaRDI QIDQ5197593

Kazuhiro Suzuki

Publication date: 19 September 2019

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

zbMATH Keywords

partitionedge-coloringcomplete graphperfect matchingsone-factorizationmulticolored spanning trees

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-disjoint rainbow spanning trees in complete graphs
• Rainbow generalizations of Ramsey theory: A survey
• Linearly many rainbow trees in properly edge-coloured complete graphs
• Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
• On the number of rainbow spanning trees in edge-colored complete graphs
• Rainbow connections of graphs: a survey
• A generalization of heterochromatic graphs and \(f\)-chromatic spanning forests
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Multicolored Isomorphic Spanning Trees in Complete Graphs
• Rainbow connection in graphs
• Rainbow spanning trees in complete graphs colored by one‐factorizations
• Multicolored trees in complete graphs
• Multicolored trees in complete graphs

This page was built for publication: $(g,f)$-Chromatic spanning trees and forests