Good news! The PRISM website is available for submissions. The planned data migration to the Scholaris server has been successfully completed. We’d love to hear your feedback at openservices@ucalgary.libanswers.com
 

ON COMPUTING ALL IRREDUCIBLE NON-EMBEDDABLE GRAPHS FOR THE PROJECTIVE PLANE THAT CONTAIN K sub 3,4

Date

1983-12-01

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

In this paper we compute a complete list of all 3-connected irreducible graphs containing a subgraph contractable to K sub 3,4 that are not embeddable into the projective plane.

Description

Keywords

Computer Science

Citation

URI

http://hdl.handle.net/1880/45684

Collections

Science Research & Publications

Powered by

Libraries & Cultural Resources

Start Something.

University of Calgary
2500 University Drive NW
Calgary Alberta T2N 1N4
CANADA

Copyright © 2023

The University of Calgary, located in the heart of Southern Alberta, both acknowledges and pays tribute to the traditional territories of the peoples of Treaty 7, which include the Blackfoot Confederacy (comprised of the Siksika, the Piikani, and the Kainai First Nations), the Tsuut’ina First Nation, and the Stoney Nakoda (including Chiniki, Bearspaw, and Goodstoney First Nations). The City of Calgary is also home to the Métis Nation of Alberta (Districts 5 and 6).

The University of Calgary is situated on land Northwest of where the Bow River meets the Elbow River, a site traditionally known as Moh’kins’tsis to the Blackfoot, Wîchîspa to the Stoney Nakoda, and Guts’ists’i to the Tsuut’ina. On this land and in this place we strive to learn together, walk together, and grow together “in a good way.”