✦ LIBER ✦

Parity graphs are kernel-M-solvable

✍ Scribed by Pierre Duchet

Book ID: 103506970
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 362 KB
Volume: 43
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(87)90016-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Opposition graphs are strict quasi-parit

Opposition graphs are strict quasi-parity graphs

✍ C. T. Hoàng; F. Maffray 📂 Article 📅 1989 🏛 Springer Japan 🌐 English ⚖ 179 KB

Perfectly orderable graphs and almost al

Perfectly orderable graphs and almost all perfect graphs are kernelM-solvable

✍ Mostafa Blidia; Konrad Engel 📂 Article 📅 1992 🏛 Springer Japan 🌐 English ⚖ 273 KB

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.

Sign solvable graphs

✍ John S. Maybee 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 723 KB

Recognizing sign solvable graphs

✍ Pierre Hansen 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 307 KB

Some graphs with characteristic polynomi

Some graphs with characteristic polynomials which are not solvable by radicals

✍ C. D. Godsil 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

## Abstract We show that “almost all” trees have characteristic polynomials which are not solvable by radicals.