๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithm 24 algorithm for deriving the chromatic polynomial of a graph

โœ Scribed by K. R. James; W. Riha

Publisher
Springer Vienna
Year
1975
Tongue
English
Weight
386 KB
Volume
14
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the chromatic polynomial of a graph
On the chromatic polynomial of a graph
โœ David Avis; Caterina De Simone; Paolo Nobili ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 121 KB
A polynomial algorithm for the extendabi
A polynomial algorithm for the extendability problem in bipartite graphs
โœ J. Lakhal; L. Litzler ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 587 KB

Let G = [ y E] be a simple connected graph and let k be an integer such that 0 < k < 1 VI /2. G is said to be k-extendable if it contains a perfect matching and every matching of k edges extends to, i.e. is a subset of, a perfect matching. The extendability problem consists in finding the maximum va

Computational algorithms for matching po
Computational algorithms for matching polynomials of graphs from the characteristic polynomials of edge-weighted graphs
โœ Haruo Hosoya; K. Balasubramanian ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 736 KB

Computational algorithms are described which provide for constructing the set of associated edgeweighted directed graphs such that the average of the characteristic polynomials of the edge-weighted graphs gives the matching polynomial of the parent graph. The weights were chosen to be unities or pur