✦ LIBER ✦

The existence of 1-factors in line graphs, squares, and total graphs

✍ Scribed by Gary Chartrand; Albert D. Polimeni; M. James Stewart

Book ID: 108046826
Publisher: Elsevier Science
Year: 1973
Weight: 320 KB
Volume: 76
Category: Article
ISSN: 1385-7258
DOI: 10.1016/1385-7258(73)90007-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The existence of even factors in iterate

The existence of even factors in iterated line graphs

✍ Liming Xiong 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 255 KB

The binding number of line graphs and to

The binding number of line graphs and total graphs

✍ Akira Saito; Tian Songlin 📂 Article 📅 1985 🏛 Springer Japan 🌐 English ⚖ 220 KB

The multiplicity of 1-factors in total g

The multiplicity of 1-factors in total graphs

✍ George R.T. Hendry 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 621 KB

## It is shown that if H --is a COMecied Stial graph of order 2n then 'Y has at least 4n -4 I-facton with equality if and only if M is the total graph of K1 + (& LJ &).

The decompositions of line graphs, middl

The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests

✍ Jin Akiyama; Takashi Hamada 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 461 KB

We construct decompositions of L(K,,), M(K,,) and T(K,,) into the minimum number of line-disjoint spanning forests by applying the usual criterion for a graph to be eulerian. This gives a realization of the arboricity of each of these three graphs. ## 1. Preliminaries In this paper a graph is cons

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 connectivities of line and total gra

The connectivities of line and total graphs

✍ Douglas Bauer; Ralph Tindell 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 371 KB 👁 1 views

## Abstract Sharp lower bounds for the point connectivity and line connectivity of the line graph __L(G__) and the total graph __T(G__) of a graph __G__ are determined. The lower bounds are expressed in terms of the point connectivity __k__, line connectivity λ, and minimum degree δ of __G.__ It is