Localizing combinatorial properties for partitions on block graphs

DOI10.1023/A:1009730825062MaRDI QIDQ1288483zbMATH OpenFDO

Authors Gerard Jennhwa Chang, Frank K. Hwang, Yi-Ching Yao

Publication date 4 March 2001

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1009730825062

zbMATH Keywords

connected block graphsconsecutive partitiongraph partitionnested partitionorder consecutive partitionpenetrationtrees

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Localizing combinatorial properties of partitions
• Characterizing block graphs in terms of their vertex-induced partitions
• Sortabilities of partition properties
• The order of uniquely partitionable graphs

Cited in

(6)

• Localizing combinatorial properties of partitions
• Sortabilities of partition properties
• Node-searching problem on block graphs
• scientific article; zbMATH DE number 2127754 (Why is no real title available?)
• Characterizing block graphs in terms of their vertex-induced partitions
• scientific article; zbMATH DE number 4187853 (Why is no real title available?)

This page was built for publication: Localizing combinatorial properties for partitions on block graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1288483)