Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...
Text: : "Graph Theory" by J. Adrian Bondy and U.S.R. Murty; Graduate Texts in Mathematics 244, Springer 2008. ISBN 978-1-84628-969-9, 2nd printing, 978-1-84628-970-5 (ebook). Notes will be supplied ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback