A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
From MaRDI portal
Publication:2502039
DOI10.1007/s00373-006-0662-3zbMath1099.05039OpenAlexW2067019296MaRDI QIDQ2502039
Publication date: 12 September 2006
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-006-0662-3
Related Items (23)
Edge-disjoint rainbow spanning trees in complete graphs ⋮ A generalization of heterochromatic graphs and \(f\)-chromatic spanning forests ⋮ Maximum properly colored trees in edge-colored graphs ⋮ Rainbow spanning trees in properly coloured complete graphs ⋮ The rainbow Steiner tree problem ⋮ A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs ⋮ Rainbow trees in uniformly edge‐colored graphs ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees in All Graphs ⋮ Colored constrained spanning tree on directed graphs ⋮ Color degree sum conditions for properly colored spanning trees in edge-colored graphs ⋮ Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\) ⋮ Sufficient conditions for the existence of spanning colored trees in edge-colored graphs ⋮ Color degree and heterochromatic cycles in edge-colored graphs ⋮ Anti-Ramsey Number of Edge-Disjoint Rainbow Spanning Trees ⋮ On the complexity of rainbow spanning forest problem ⋮ Properly colored spanning trees in edge-colored graphs ⋮ The rainbow spanning forest problem ⋮ Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey ⋮ Rainbow and properly colored spanning trees in edge-colored bipartite graphs ⋮ On the number of heterochromatic trees in nice and beautiful colorings of complete graphs ⋮ Maximum colored trees in edge-colored graphs ⋮ Rainbow faces in edge‐colored plane graphs ⋮ $(g,f)$-Chromatic spanning trees and forests
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new proof of a theorem of Graham and Pollak
- Multicolored forests in bipartite decompositions of graphs
- Rainbow numbers for matchings and complete graphs
- Multicoloured Hamilton cycles
- On the decomposition ofkn into complete bipartite graphs
- Rainbow subgraphs in properly edge‐colored graphs
- Rainbow coloring the cube
- On the Addressing Problem for Loop Switching
- Multicolored trees in complete graphs
- A lower bound for the length of a partial transversal in a Latin square
- Multicolored forests in complete bipartite graphs
This page was built for publication: A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
