✦ LIBER ✦

The properties of connected graphs and some corrections to the list of Uhlenbeck and Ford

✍ Scribed by J. S. Rowlinson

Publisher: Springer
Year: 1986
Tongue: English
Weight: 75 KB
Volume: 42
Category: Article
ISSN: 0022-4715
DOI: 10.1007/bf01010453

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Systematic generation of linear graphs—

Systematic generation of linear graphs— Check and extension of the list of uhlenbeck and ford

✍ Ch Foidl; P Kasperkovitz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 55 KB

Some results on the majorization theorem

Some results on the majorization theorem of connected graphs

✍ Mu Huo Liu; Bo Lian Liu 📂 Article 📅 2012 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 207 KB

Graphs connected to the hadamard manifol

Graphs connected to the hadamard manifold and groups of its isometries

✍ S. V. Buyalo 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 780 KB

Forbidden subgraphs and hamiitonian prop

Forbidden subgraphs and hamiitonian properties in the square of a connected graph

✍ Ronald J. Gould; Michael S. Jacobson 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 331 KB 👁 1 views

Various Hamiltonian-like properties are investigated in the squares of connected graphs free of some set of forbidden subgraphs. The star K,+ the subdivision graph of &, and the subdivision graph of K1,3 minus an endvertex play central roles. In particular, we show that connected graphs free of the

On Connection Between the Structure of a

On Connection Between the Structure of a Finite Group and the Properties of Its Prime Graph

✍ A. V. Vasil’ev 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 214 KB

Some properties of cycle-free directed g

Some properties of cycle-free directed graphs and the identification of the longest path

✍ Y.C. Chen; O. Wing 📂 Article 📅 1966 🏛 Elsevier Science 🌐 English ⚖ 444 KB

XBSTRACT: A number of interesting properties of a cycle-free directed graph are presented By making use of these properties an e.Oicient algorithm is deduced which identifies the longest path, or the Hamiltonian path if any, between every pair of vertices. The properties are expressed in terms of th