Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs.
Ku, Cheng Yeaw, Wong, Kok Bin (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Maximum multiplicity of a root of the matching polynomial of a tree and minimum path cover.”
Maximum multiplicity of matching polynomial roots and minimum path cover in general graphs.
Algebraic matching theory.
Godsil, C.D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On cubes and dichotomic trees
Ladislav Nebeský (1974)
Časopis pro pěstování matematiky
Similarity:
Embedding trees into clique-bridge-clique graphs
Bohdan Zelinka (1979)
Časopis pro pěstování matematiky
Similarity:
Caterpillars
Bohdan Zelinka (1977)
Časopis pro pěstování matematiky
Similarity: