Boundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph

Simple item page
dc.creatorHara, Hisayuki
dc.creatorTakemura, Akimichi
dc.date2006-07-11
dc.date.accessioned2026-07-07T07:16:19Z
dc.date.available2026-07-07T07:16:19Z
dc.descriptionWe characterize clique trees of a chordal graph in their relation to simplicial vertices and perfect sequences of maximal cliques. We investigate boundary cliques defined by Shibata and clarify their relation to endpoints of clique trees. Next we define a symmetric binary relation between the set of clique trees and the set of perfect sequences of maximal cliques. We describe the relation as a bipartite graph and prove that the bipartite graph is always connected. Lastly we consider to characterize chordal graphs from the aspect of non-uniqueness of clique trees.
dc.identifierhttps://arxiv.org/abs/cs/0607055
dc.identifierhttp://arxiv.org/abs/cs/0607055
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/113547
dc.subjectDiscrete Mathematics
dc.subjectG.2.2
dc.titleBoundary cliques, clique trees and perfect sequences of maximal cliques of a chordal graph
dc.typetext

Files

Collections

arXiv