✦ LIBER ✦

The parity of the number of 1-factors of a graph

✍ Scribed by Charles H.C. Little

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 344 KB
Volume: 2
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(72)90083-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Largest Parity Demigenus of a Simple

The Largest Parity Demigenus of a Simple Graph

✍ Thomas Zaslavsky 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 421 KB

A graph 1 is parity embedded in a surface if a closed path in the graph is orientation preserving or reversing according as its length is even or odd. The parity demigenus of 1 is the minimum of 2&/(S) (where / is Euler characteristic) over all surfaces S in which 1 can be parity embedded. We calcul

The discipline number of a graph

✍ V. Chvátal; W. Cook 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 481 KB

The hull number of a graph

✍ Martin G Everett; Stephen B Seidman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 379 KB

A set of points S of a graph is convex if any geodesic joining two points of S lies entirely within S. The convex hull of a set T of points is the smallest convex set that contains T. The hull number (h) of a graph is the cardinality of the smallest set of points whose convex hull is the entire grap

The bondage number of a graph

✍ John Frederick Fink; Michael S. Jacobson; Lael F. Kinch; John Roberts 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 654 KB

A 1-factorization of the line graphs of

A 1-factorization of the line graphs of complete graphs

✍ Brian Alspach 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 254 KB 👁 1 views

## Abstract A 1‐factorization is constructed for the line graph of the complete graph __K~n~__ when __n__ is congruent to 0 or 1 modulo 4.

The multiplicity of 1-factors in the squ

The multiplicity of 1-factors in the square of a graph

✍ G. R. T. Hendry 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 225 KB 👁 1 views

Several authors have shown that if G is a connected graph of even order then its square G2 has a I-factor. We show that the square of any connected graph of order 2n has at least n I-factors and describe all the extremal graphs.