✦ LIBER ✦

Equivalence of the strengthened Hanna Neumann conjecture and the amalgamated graph conjecture

✍ Scribed by Warren Dicks

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 721 KB
Volume: 117
Category: Article
ISSN: 0020-9910
DOI: 10.1007/bf01232249

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The rise and fall of the critical graph

The rise and fall of the critical graph conjecture

✍ Amanda G. Chetwynd; Robin J. Wilson 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract In this expository paper we discuss the critical graph conjecture and its eventual disproof by M.K. Goldberg and others.

The equivalence of two conjectures of Be

The equivalence of two conjectures of Berge and Fulkerson

✍ G. Mazzuoccolo 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 65 KB

Let G be a bridgeless cubic graph. Fulkerson conjectured that there exist six 1-factors of G such that each edge of G is contained in exactly two of them. Berge conjectured that the edge-set of G can be covered with at most five 1-factors. We prove that the two conjectures are equivalent.

Bounds and conjectures for the signless

Bounds and conjectures for the signless Laplacian index of graphs

✍ Pierre Hansen; Claire Lucas 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 267 KB

Representation of proofs by colored grap

Representation of proofs by colored graphs and the hadwiger conjecture

✍ P. Yu. Suvorov 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 578 KB

A graph-theoretic version of the union-c

A graph-theoretic version of the union-closed sets conjecture

✍ El-Zahar, Mohamed H. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 2 views

An induced subgraph S of a graph G is called a derived subgraph of G if S contains no isolated vertices. An edge e of G is said to be residual if e occurs in more than half of the derived subgraphs of G. We introduce the conjecture: Every non-empty graph contains a non-residual edge. This conjecture

Families of graphs complete for the stro

Families of graphs complete for the strong perfect graph Conjecture

✍ D. G. Corneil 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 381 KB 👁 1 views

The Strong Perfect Graph Conjecture states that a graph is perfect iff neither it nor its complement contains an odd chordless cycle of size greater than or equal to 5. In this article it is shown that many families of graphs are complete for this conjecture in the sense that the conjecture is true