Full metadata record
DC FieldValueLanguage
dc.contributor.authorChang, GJen_US
dc.contributor.authorHwang, FKen_US
dc.contributor.authorYao, YCen_US
dc.date.accessioned2014-12-08T15:47:07Z-
dc.date.available2014-12-08T15:47:07Z-
dc.date.issued1999en_US
dc.identifier.issn1382-6905en_US
dc.identifier.urihttp://hdl.handle.net/11536/31623-
dc.description.abstractWe extend the study on partition properties from the set partition to the graph partition, especially for the class of connected block graphs which includes trees. We introduce seventeen partition properties and determine their inter-relations. The notions of k-consistency and k-sortability were studied in the set partition to localize the properties, i.e., a global property can be verified through checking local conditions. We carry on these studies for partitions on connected block graphs. In particular, we completely determine the consistency for an the seventeen properties.en_US
dc.language.isoen_USen_US
dc.subjectpartitionen_US
dc.subjectblock graphen_US
dc.subjecttreeen_US
dc.subjectpenetrationen_US
dc.subjectnested partitionen_US
dc.subjectconsecutive partitionen_US
dc.subjectorder consecutive partitionen_US
dc.titleLocalizing combinatorial properties for partitions on block graphsen_US
dc.typeArticleen_US
dc.identifier.journalJOURNAL OF COMBINATORIAL OPTIMIZATIONen_US
dc.citation.volume2en_US
dc.citation.issue4en_US
dc.citation.spage429en_US
dc.citation.epage441en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.identifier.wosnumberWOS:000079289400010-
dc.citation.woscount1-
Appears in Collections:Articles


Files in This Item:

  1. 000079289400010.pdf