✦ LIBER ✦

A note on a conjecture by Gavril on clique separable graphs

✍ Scribed by D.G. Corneil; J.M. Keil

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 193 KB
Volume: 46
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(83)90127-9

No coin nor oath required. For personal study only.

✦ Synopsis

conjecture concerning the characterization of clique

📜 SIMILAR VOLUMES

Algorithms on clique separable graphs

✍ Fǎnicǎ Gavril 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 925 KB

We define a family of graphs. tailed the clique sepambk graphs. characterized by the fact that they have completely connected rut sets by which we decompose them into r)arts such that when no further decomposition is possible we have a set of simple subgraphs. For example the chordal gmphs and the i

A note on the semi-strong perfect graph

A note on the semi-strong perfect graph conjecture

✍ B Reed 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 119 KB

On a harmonious graph conjecture

✍ Eugene Levine 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 125 KB

Let K~ ) be the umon of two complete graphs on n vertices which have preosely one vertex in common. Graham and Sloane have shown that K~ ~ is not harmomous for n od:~, /(~,~ is harmonious, and K~62~ is not harmonious. They also conjecture that K~' t,, not h,~rmomous except for n = 4. Here, it Is sho

A note on graphs spanned by Eulerian gra

A note on graphs spanned by Eulerian graphs

✍ W. R. Pulleyblank 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 1 views

## Abstract We show that the problem raised by Boesch, Suffel, and Tindell of determining whether or not a graph is spanned by an Eulerian subgraph is NP‐complete. We also note that there does exist a good algorithm for determining if a graph is spanned by a subgraph having positive even degree at

A note on packing trees into complete bi

A note on packing trees into complete bipartite graphs and on fishburn's conjecture

✍ Y. Caro; Y. Rodity 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 212 KB

In this note we improve significantly the result appeared in [4] by showing that any sequence of trees { T2, 'I;, . , T,} can be packed into the complete bipartite graph K,\_,,n,z (n even) for f = 0.3n. Furthermore we support Fishburn's Conjecture [2] by showing that any sequence {T,, T4,

A note on the abc conjecture

✍ Pei-Chu Hu; Chung-Chun Yang 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB