scientific article; zbMATH DE number 5844230

MaRDI QIDQ3070274zbMATH OpenFDO

Authors R. Schott, J. P. McSorley, Ph. Feinsilver

Publication date 2 February 2011

zbMATH Keywords

Taylor's expansionvertex\(| \)matching-partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Generalization of matching extensions in graphs -- combinatorial interpretation of orthogonal and \(q\)-orthogonal polynomials
• Orthogonal polynomials through complex matrix graph theory
• On generating orthogonal polynomials for discrete measures
• A computational framework for the study of partition functions and graph polynomials
• scientific article; zbMATH DE number 2115826
• A generalization of orthogonal factorizations in graphs
• On generating discrete orthogonal bivariate polynomials
• On generating symmetric orthogonal polynomials
• scientific article; zbMATH DE number 7145170
• scientific article; zbMATH DE number 3943829

Cited in

(2)

• The \(m\)-path cover polynomial of a graph and a model for general coefficient linear recurrences
• Generalization of matching extensions in graphs -- combinatorial interpretation of orthogonal and \(q\)-orthogonal polynomials

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070274)