✦ LIBER ✦

Hedetniemi's Conjecture and the Retracts of a Product of Graphs

✍ Scribed by Benoit Larose; Claude Tardif

Publisher: Springer-Verlag
Year: 2000
Tongue: English
Weight: 236 KB
Volume: 20
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s004930070006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Graham’s pebbling conjecture on product

Graham’s pebbling conjecture on product of complete bipartite graphs

✍ Rongquan Feng; Ju Young Kim 📂 Article 📅 2001 🏛 SP Science China Press 🌐 English ⚖ 318 KB

A proof of Golomb's conjecture for the d

A proof of Golomb's conjecture for the de Bruijn graph

✍ Johannes Mykkeltveit 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 261 KB

On a conjecture concerning the reconstru

On a conjecture concerning the reconstruction of graphs

✍ Roger M Bryant 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 138 KB

Circuit Coverings of Graphs and a Conjec

Circuit Coverings of Graphs and a Conjecture of Pyber

✍ G.H. Fan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 260 KB

An equivalent statement of the circuit double cover conjecture is that every bridgeless graph \(G\) has a circuit cover such that each vertex \(v\) of \(G\) is contained in at most \(d(v)\) circuits of the cover, where \(d(v)\) is the degree of \(v\). Pyber conjectured that every bridgeless graph \(

Subdivision Number of Graphs and Falsity

Subdivision Number of Graphs and Falsity of a conjecture

✍ V. Swaminathan; P. Sumathi 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 67 KB

Equivalence of the strengthened Hanna Ne

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

✍ Warren Dicks 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 721 KB