✦ LIBER ✦

A note on two problems in connexion with graphs

✍ Scribed by E. W. Dijkstra

Book ID: 105172896
Publisher: Springer-Verlag
Year: 1959
Tongue: English
Weight: 136 KB
Volume: 1
Category: Article
ISSN: 0029-599X
DOI: 10.1007/bf01386390

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on the tour problems in two-termi

A note on the tour problems in two-terminal series-parallel graphs

✍ Y.L. Wang; R.S. Chang; C.C. Hsu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 619 KB

A note on some embedding problems for or

A note on some embedding problems for oriented graphs

✍ Andrew Treglown 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 88 KB

We conjecture that every oriented graph G on n vertices with + (G), -(G) ≥ 5n / 12 contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing of transitive triangles in an oriented graph. A link between Ramsey numbers and perfe

A note on proofs with graphs

✍ Renata de Freitas; Petrucio Viana 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 312 KB

A note on the graph isomorphism counting

A note on the graph isomorphism counting problem

✍ Rudolf Mathon 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 599 KB

A note on the bottleneck graph partition

A note on the bottleneck graph partition problem

✍ Klinz, Bettina; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit

A Note on Two 'Problems' of Induction

✍ Paul K. Feyerabend 📂 Article 📅 1968 🏛 Oxford University Press 🌐 English ⚖ 346 KB