[HTML][HTML] A five-element transformation monoid on labelled trees
Y Wu, Z Xu, Y Zhu - European Journal of Combinatorics, 2019 - Elsevier
For each tree T on n vertices, a labelling of T is a bijective map from the vertex set of T to the
first n positive integers. We consider two maps, which send the labellings of T to labellings of …
first n positive integers. We consider two maps, which send the labellings of T to labellings of …
A Study on Graph Operators and Colorings
V Suresh Dara - 2017 - idr.l2.nitk.ac.in
In 1972, Erdös-Faber-Lovász conjectured that, if H is a linear hypergraph consisting of n
edges of cardinality n, then it is possible to color the vertices with n colors so that no two …
edges of cardinality n, then it is possible to color the vertices with n colors so that no two …