𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Opposition graphs are strict quasi-parity graphs

✍ Scribed by C. T. Hoàng; F. Maffray

Book ID
105309489
Publisher
Springer Japan
Year
1989
Tongue
English
Weight
179 KB
Volume
5
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Perfectly orderable graphs are quasi-par
Perfectly orderable graphs are quasi-parity graphs: a short proof
✍ A. Hertz; D. de Werra 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 287 KB

%'c shw that perfectly orderabk grapk Sa are q&-parity graphs by exhibiting two &lodes which are not llinked by a chordless odd chain. This proof is short and simpler than the one given by H. Meynid.

Continuous k-to-1 functions between comp
Continuous k-to-1 functions between complete graphs whose orders are of a different parity
✍ John Baptist Gauci; Anthony J. W. Hilton 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB

A function between graphs is k-to-1 if each point in the codomain has precisely k pre-images in the domain. Given two graphs, G and H, and an integer k ≥ 1, and considering G and H as subsets of R 3 , there may or may not be a k-to-1 continuous function (i.e. a k-to-1 map in the usual topological se