✦ LIBER ✦

Perfectly orderable graphs are quasi-parity graphs: a short proof

✍ Scribed by A. Hertz; D. de Werra

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 287 KB
Volume: 68
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90047-7

No coin nor oath required. For personal study only.

✦ Synopsis

%'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.

📜 SIMILAR VOLUMES

Quasi-brittle graphs, a new class of per

Quasi-brittle graphs, a new class of perfectly orderable graphs

✍ Stephan Olariu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 893 KB

A graph G is quasi-brittle if every induced subgraph H of G contains a vertex which is incident to no edge extending symmetrically to a chordless path with three edges in either H or its complement 8. The quasi-britiie graphs turn out to be a natural generalization of the well-known class of brittle

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