×

zbMATH — the first resource for mathematics

An introduction to matching polynomials. (English) Zbl 0335.05131

MSC:
05C99 Graph theory
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Berge, C, ()
[2] Busacker, R.G; Saaty, T.L, ()
[3] Edmonds, J, Res. nat. bur. standards sect. B, 69, (1965)
[4] Edmonds, J, Maximal matching and a polyhedron with 0,1-vertices, Nat. bur. standards rept., (1963), mimeographed
[5] Edmonds, J, Paths, trees, and flowers, Nat. bur. standards rept., (1964), mimeographed · Zbl 0132.20903
[6] Farrell, E.J, On a general class of graph polynomials, () · Zbl 0328.05006
[7] Harary, F, ()
[8] Harary, F; King, C; Mowshowitz, A; Read, R.C, Cospectral graphs and digraphs, Bull. London math. soc., 3, 321-328, (1971) · Zbl 0224.05125
[9] Liu, C.L, ()
[10] Mowshowitz, A, The characteristic polynomial of a graph, J. combinatorial theory ser. B, 12, 177-193, (1972) · Zbl 0212.29401
[11] Read, R.C, An introduction to chromatic polynomials, J. combinatorial theory, 4, 52-71, (1968) · Zbl 0173.26203
[12] Sachs, H, Beziehungen zwischen den in einem graphen enthaltenen kreisen und seinem charakteristischen polynom, Publ. math. debrecen, 11, 119-139, (1964) · Zbl 0137.18103
[13] Schwenk, A.J, Almost all trees are cospectral, () · Zbl 0261.05102
[14] Tutte, W.T, The factorization of linear graphs, J. London math. soc., 22, 107-111, (1947) · Zbl 0029.23301
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.