𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a conjecture concerning the reconstruction of graphs

✍ Scribed by Roger M Bryant

Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
138 KB
Volume
11
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On a conjecture of Gallai concerning com
On a conjecture of Gallai concerning complete subgraphs of k-critical graphs
✍ H.L. Abbott; B. Zhou πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 418 KB

Abbott, H.L. and B. Zhou, On a conjecture of Gallai concerning complete subgraphs of k-critical graphs, Discrete Mathematics 100 (1992) 223-228. A graph G is said to be k-critical if it has chromatic number k but every proper subgraph of G has a (k -l)-coloring. T. Gallai asked whether each k-criti

The reconstruction conjecture is true if
The reconstruction conjecture is true if all 2-connected graphs are reconstructible
✍ Yang Yongzhi πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 344 KB

It is shown that the Reconstruction Conjecture is true for all finite graphs if it is true for the 2-connected ones. We shall, for the most part, use the terminology of [2] and [ 4 ] . Graphs will be finite, simple, and undirected. Let G be a graph and u E V(G). Denote by d(u) the degree of u in G

On a Conjecture of LovΓ‘sz Concerning Bri
On a Conjecture of LovΓ‘sz Concerning Bricks: I. The Characteristic of a Matching Covered Graph
✍ Marcelo H. de Carvalho; ClΓ‘udio L. Lucchesi; U.S.R. Murty πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 292 KB

In 1987, Lova Β΄sz conjectured that every brick G different from K 4 , C Β―6, and the Petersen graph has an edge e such that G -e is a matching covered graph with exactly one brick. Lova Β΄sz and Vempala announced a proof of this conjecture in 1994. Their paper is under preparation. In this paper and i