✦ LIBER ✦

(0,1)-Matrices, factors in graphs, faithful graphs

✍ Scribed by Guy Chaty

Book ID: 114879168
Publisher: John Wiley and Sons
Year: 1970
Tongue: English
Weight: 119 KB
Volume: 175
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1970.tb56457.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Faithful 1-edge fault tolerant graphs

✍ Shih-Yih Wang; Lih-Hsing Hsu; Ting-Yi Sung 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 726 KB

A graph G\* is l-edge fault tolerant with respect to a graph G, denoted by I-EFT( G), if any graph obtained by removing an edge from G' contains G. A l-Em(G) graph is said to be optimal if it contains the minimum number of edges among all I-EFT( G) graphs. Let Gf be 1 -EJ!T( Gi) for i = 1,2. It can

End-faithful spanning trees inT1-free gr

End-faithful spanning trees inT1-free graphs

✍ Polat, Norbert 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

We prove that any connected graph that contains no subdivision of an ℵ 1regular tree has an end-faithful spanning tree; and furthermore that it has a rayless spanning tree if all its ends are dominated. This improves a result of Seymour and Thomas (An end-faithful spanning tree counterexample, Discr

Counting 1-factors in infinite graphs

✍ Ron Aharoni; Mao Lin Zheng 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 627 KB

Partitions in Matrices and Graphs

✍ Hughes, D.R.; Singhi, N.M. 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 831 KB

Covering of graphs by complete bipartite

Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matrices

✍ Zsolt Tuza 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 276 KB

The existence of 1-factors in line graph

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

✍ Gary Chartrand; Albert D. Polimeni; M. James Stewart 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 320 KB