Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs.
Ku, Cheng Yeaw ; Wong, Kok Bin
The Electronic Journal of Combinatorics [electronic only], Tome 18 (2011), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2011-01-01
EUDML-ID : urn:eudml:doc:233784 
@article{05852488,
     title = {Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {18},
     year = {2011},
     zbl = {1229.05121},
     language = {en},
     url = {http://dml.mathdoc.fr/item/05852488}
}

Ku, Cheng Yeaw; Wong, Kok Bin. Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs.. The Electronic Journal of Combinatorics [electronic only], Tome 18 (2011) . http://gdmltest.u-ga.fr/item/05852488/