Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs.

Ku, Cheng Yeaw, and Wong, Kok Bin. "Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P38, 12 p., electronic only-Research Paper P38, 12 p., electronic only. <http://eudml.org/doc/233784>.

@article{Ku2011,
author = {Ku, Cheng Yeaw, Wong, Kok Bin},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {-extremal path cover; Gallai-Edmonds Structure Theorem for general root; -extremal path cover},
language = {eng},
number = {1},
pages = {Research Paper P38, 12 p., electronic only-Research Paper P38, 12 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs.},
url = {http://eudml.org/doc/233784},
volume = {18},
year = {2011},
}

TY - JOUR
AU - Ku, Cheng Yeaw
AU - Wong, Kok Bin
TI - Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2011
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 18
IS - 1
SP - Research Paper P38, 12 p., electronic only
EP - Research Paper P38, 12 p., electronic only
LA - eng
KW - -extremal path cover; Gallai-Edmonds Structure Theorem for general root; -extremal path cover
UR - http://eudml.org/doc/233784
ER -