Anti-Ramsey number of Hanoi graphs

DOI10.7151/dmgt.2078zbMath1401.05192OpenAlexW2802269914WikidataQ129945864 ScholiaQ129945864MaRDI QIDQ1630944

Anna Lechowska, Izolda Gorgol

Publication date: 5 December 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2078

zbMATH Keywords

rainbow numberanti-Ramsey numberHanoi graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (1)

Anti-Ramsey numbers for cycles in the generalized Petersen graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Anti-Ramsey numbers in complete split graphs
• Rainbow numbers for matchings in plane triangulations
• Coloring Hanoi and Sierpiński graphs
• Rainbow generalizations of Ramsey theory: A survey
• On the planarity of Hanoi graphs
• The anti-Ramsey number of perfect matching
• Rainbows in the hypercube
• Bipartite rainbow numbers of matchings
• A rainbow \(k\)-matching in the complete graph with \(r\) colors
• Edge-colorings of complete graphs that avoid polychromatic trees
• Edge-colorings with no large polychromatic stars
• Rainbow numbers for matchings and complete graphs
• The fourth tower of Hanoi
• An anti-Ramsey theorem on cycles
• The Tower of Hanoi – Myths and Maths
• Coloring and Counting on the Tower of Hanoi Graphs
• Bipartite anti-Ramsey numbers of cycles
• On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems
• On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle
• Rainbow Numbers for Cycles in Plane Triangulations
• On totally multicolored stars

This page was built for publication: Anti-Ramsey number of Hanoi graphs