Skip to main content
Conference Proceedings

Plane graphs with acyclic complex

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2108 395-399
DOI: 10.1007/3-540-44679-6_44
1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

All vertex-sets of cliques of G form the simplexes of an abstract complex C(G), which is called the clique complex of G. It is proved that the clique complex of a plane graph G is acyclic if and only if G is contractible.

Cite

CITATION STYLE

APA

Xu, B. (2001). Plane graphs with acyclic complex. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2108, pp. 395–399). Springer Verlag. https://doi.org/10.1007/3-540-44679-6_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free