On the number of heterochromatic trees in nice and beautiful colorings of complete graphs
From MaRDI portal
Publication:2062897
DOI10.1007/s00373-021-02436-0zbMath1479.05117arXiv2106.02905OpenAlexW4200034904MaRDI QIDQ2062897
Ricardo Strausz, Eduardo Rivera-Campo, Juan José Montellano-Ballesteros
Publication date: 3 January 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.02905
Cites Work
- On the heterochromatic number of hypergraphs associated to geometric graphs and to matroids
- A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
- Multicolored trees in complete graphs
- Multicolored trees in complete graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item