✦ LIBER ✦

The interchange graph of a finite graph

✍ Scribed by A. C. M. van Rooij; H. S. Wilf

Publisher: Akadmiai Kiad
Year: 1965
Tongue: English
Weight: 284 KB
Volume: 16
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01904834

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the graph for which there is a tree a

On the graph for which there is a tree as the inverse interchange graph of a local graph

✍ Juhani Nieminen 📂 Article 📅 1972 🏛 Springer 🌐 English ⚖ 347 KB

Hamiltonicity of a type of interchange g

Hamiltonicity of a type of interchange graphs

✍ Xueliang Li; Fuji Zhang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 338 KB

Every finite graph is a full subgraph of

Every finite graph is a full subgraph of a rigid graph

✍ V Chvátal; P Hell; L Kučera; J Nešetřil 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Two characterizations of interchange gra

Two characterizations of interchange graphs of complete m-partite graphs

✍ Curtis R. Cook 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 564 KB

A graph G is m-partite if its points can be partitioned into m subsets Yl, . . . . Vm such that every line joins a point in Vi with a point in Vi, i + j. A complete m-partite graph contains every line joining Vi with V-. A complete graph Kp has every pair of its p points adjacent. The nth interchang

Interchange graphs and the Hamiltonian c

Interchange graphs and the Hamiltonian cycle polytope

✍ Gerard Sierksma 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 464 KB

This paper answers the (non)adjacency question for the whole spectrum of Hamiltonian cycles on the Hamiltonian cycle polytope (HC-polytope), also called the symmetric traveling salesman polytope, namely from Hamiltonian cycles that differ in only two edges through Hamiltonian cycles that are edge di

Twistor Theory on a Finite Graph

✍ Paul Baird; Mohammad Wehbe 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 275 KB