scientific article; zbMATH DE number 1279034

MaRDI QIDQ4239589zbMATH OpenFDO

Authors Jonathan Holland, Earl Glen jun. Whitehead

Publication date 26 April 1999

zbMATH Keywords

Fibonacci numbersLucas numbersmatching equivalentmatching polynomial

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Recommendations

• Matching equivalencies of bipartite graphs
• The exactly divide ability of several matching polynomial of graphs and the matching equivalent graphs of \(T_{2,2,n}\)
• The matching equivalent graphs of P_m Q (3, n)
• The matching equivalent classes of graphs of K₁ I_n
• Some general classes of comatching graphs

Cited in

(23)

• Some general classes of comatching graphs
• On the theory of matching equivalent graphs and rook equivalent chessboards
• A class of `matching-equivalent' bipartite graphs
• A term equality problem equivalent to graph isomorphism
• On matching integral graphs
• Equivalence classes in matching covered graphs
• Sequences of matchings in path-type graphs
• scientific article; zbMATH DE number 3873377 (Why is no real title available?)
• The matching equivalence classes of graphs with the maximum matching root less than or equal to 2
• The matching equivalent graphs of P_m Q (3, n)
• scientific article; zbMATH DE number 5532149 (Why is no real title available?)
• scientific article; zbMATH DE number 4123550 (Why is no real title available?)
• scientific article; zbMATH DE number 951843 (Why is no real title available?)
• On the matching polynomial of theta graphs.
• scientific article; zbMATH DE number 7366336 (Why is no real title available?)
• A note on the matching polynomials of paths and cycles
• The exactly divide ability of several matching polynomial of graphs and the matching equivalent graphs of \(T_{2,2,n}\)
• The matching equivalent classes of graphs of K₁ I_n
• scientific article; zbMATH DE number 2239801 (Why is no real title available?)
• Matching equivalencies of bipartite graphs
• The ultimate categorical matching in a graph
• Equivariant log-concavity of graph matchings
• The new methods for constructing matching-equivalence graphs

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 Q4239589)