Plane Graphs with Acyclic Complex

Authors:
Baogang Xu
Affiliations:
-
Venue:
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Year:
2001

Citing 3
Cited 0

Finite topology as applied to image analysis

Computer Vision, Graphics, and Image Processing
Contractible transformations do not change the homology groups of graphs

Discrete Mathematics
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

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.