Now showing items 1-2 of 2
The number of order–preserving maps of fences and crowns
We perform an exact enumeration of the order-preserving maps of fences (zig-zags) and crowns (cycles). From this we derive asymptotic results.
A Characterization of Fractionally Well-Covered Graphs
(Ars Combinatoria, 1991)
A graph is called well-covered if every maximal independent set has the same size. One generalization of independent sets in graphs is that of a fractional cover -- attach nonnegative weights to the vertices and require ...