✦ LIBER ✦

Subdivision Number of Graphs and Falsity of a conjecture

✍ Scribed by V. Swaminathan; P. Sumathi

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 67 KB
Volume: 15
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00585-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The falsity of the reconstruction conjec

The falsity of the reconstruction conjecture for tournaments

✍ Paul K. Stockmeyer 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 306 KB 👁 1 views

## Abstract The conjecture that for all sufficiently large __p__ any tournament of order __p__ is uniquely reconstructable from its point‐deleted subtournaments is shown to be false. Counterexamples are presented for all orders of the form 2^n^ + 1 and 2^n^ + 2. The largest previously known counter

A counterexample to a conjecture on the

A counterexample to a conjecture on the bondage number of a graph

✍ Ulrich Teschner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 113 KB

The bondage number h(G) of a nonempty graph G was first introduced by Fink, Jacobson, Kinch and Roberts in [3]. They generalized a former approach to domination-critical graphs, In their publication they conjectured that b(G)<d(G)+ 1 for any nonempty graph G.

Erratum to: “The falsity of the reconstr

Erratum to: “The falsity of the reconstruction conjecture for tournaments”

✍ Paul K. Stockmeyer 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 37 KB 👁 1 views

It has been brought to my attention by Ramachandran that there is an error in the proof of Theorem 1 in my paper [1]. The theorem is true-the pairs of vertex-deleted tournaments are isomorphic-but the description of the isomorphism is incorrect. The number r i should not be the remainder of i modulo

Resolution of AutoGraphiX conjectures re

Resolution of AutoGraphiX conjectures relating the index and matching number of graphs

✍ Dragan Stevanović 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 131 KB

Some probabilistic and extremal results

Some probabilistic and extremal results on subdivisions and odd subdivisions of graphs

✍ Leif Kjær Jørgensen 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 514 KB

A probabilistic result of Bollobas and Catlin concerning the largest integer p so that a subdivision of K, is contained in a random graph is generalized to a result concerning the largest integer p so that a subdivision of A, is contained in a random graph for some sequence Al, A\*, . . . of graphs

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 \(