✦ LIBER ✦

Almost rank three graphs

✍ Scribed by A. Gardiner

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 314 KB
Volume: 103
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90317-9

No coin nor oath required. For personal study only.

✦ Synopsis

Gardiner,

A., Almost rank three graphs, Discrete Mathematics 103 (1992) 253-257.

📜 SIMILAR VOLUMES

Almost every graph has reconstruction nu

Almost every graph has reconstruction number three

✍ Béla Bollobás 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## Abstract The paper contains a proof of the conjecture of Harary and Plantholt, stated in the title.

On rank three graphs with a large eigenv

On rank three graphs with a large eigenvalue

✍ Carl Bumiller 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 337 KB

Almost claw-free graphs

✍ Zdeněk Ryjáček 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 374 KB

## Abstract We say that __G__ is almost claw‐free if the vertices that are centers of induced claws (__K__~1,3~) in __G__ are independent and their neighborhoods are 2‐dominated. Clearly, every claw‐free graph is almost claw‐free. It is shown that (i) every even connected almost claw‐free graph has

Almost all quasigroups have rank 2

✍ Peter J. Cameron 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 316 KB

Almost-regular factorization of graphs

✍ Jin Akiyama; Mikio Kano 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 238 KB

For integers a and b, 0 s a s b, an [a,bl-graph G satisfies a s deg(x,G) s b for every vertex x of G, and an [a.bl-factor is a spanning subgraph its edges can be decomposed into [a,bl-factors. When both k and tare positive integers and s is a nonnegative integer, w e prove that every [(12k + 2)t +

Almost reconstructing infinite, rayless

Almost reconstructing infinite, rayless graphs

✍ Rüdiger Schmidt 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 291 KB

We show that for every infinite, rayless graph G the following holds. If G is hypomorphic to H then G is isomorphic to an induced subgraph of H and H is isomorphic to an induced subgraph of G. This proves a conjecture of R. Halin for the class of infinite, rayless graphs and partly extends a result