On the total weight of weighted matchings of segment graphs
The electronic journal of combinatorics, Tome 16 (2009) no. 1
We study the total weight of weighted matchings in segment graphs, which is related to a question concerning generalized Chebyshev polynomials introduced by Vauchassade de Chaumont and Viennot and, more recently, investigated by Kim and Zeng. We prove that weighted matchings with sufficiently large node-weight cannot have equal total weight.
@article{10_37236_145,
author = {Thomas Stoll and Jiang Zeng},
title = {On the total weight of weighted matchings of segment graphs},
journal = {The electronic journal of combinatorics},
year = {2009},
volume = {16},
number = {1},
doi = {10.37236/145},
zbl = {1165.05339},
url = {http://geodesic.mathdoc.fr/articles/10.37236/145/}
}
Thomas Stoll; Jiang Zeng. On the total weight of weighted matchings of segment graphs. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/145
Cité par Sources :