✦ LIBER ✦

Knots and Graphs I—Arc Graphs and Colorings

✍ Scribed by Frank Harary; Louis H. Kauffman

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 451 KB
Volume: 22
Category: Article
ISSN: 0196-8858
DOI: 10.1006/aama.1998.0634

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equipartite colorings in graphs and hype

Equipartite colorings in graphs and hypergraphs

✍ C Berge; F Sterboul 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 853 KB

Knots and links in spatial graphs

✍ J. H. Conway; C. McA. Gordon 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 328 KB

## Abstract The main purpose of this paper is to show that any embedding of __K~7~__ in three‐dimensional euclidean space contains a knotted cycle. By a similar but simpler argument, it is also shown that any embedding of __K~6~__ contains a pair of disjoint cycles which are homologically linked.

Dual graphs and knot invariants

✍ Magnhild Lien; William Watkins 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 159 KB

On powers of circular arc graphs and pro

On powers of circular arc graphs and proper circular arc graphs

✍ Carsten Flotow 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 537 KB

I-Colorings, I-Phasings, and I-Intersect

I-Colorings, I-Phasings, and I-Intersection assignments for graphs, and their applications

✍ Robert J. Opsut; Fred S. Roberts 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 718 KB

Efficient algorithms for interval graphs

Efficient algorithms for interval graphs and circular-arc graphs

✍ U. I. Gupta; D. T. Lee; J. Y.-T. Leung 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 476 KB

## Abstract We show that for an interval graph given in the form of a family of intervals, a maximum independent set, a minimum covering by disjoint completely connected sets or cliques, and a maximum clique can all be found in __O__(__n__ log __n__) time [__O__(__n__) time if the endpoints of the