Some properties of graph centroids

DOI10.1007/BF02115757zbMath0747.90103MaRDI QIDQ1179740

Maciej M. Sysło, Wiktor Piotrowski

Publication date: 27 June 1992

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

centroidclique separatorchordless path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Structural characterization of families of graphs (05C75)

Related Items (1)

Branch-weight unique trees

Cites Work

• On rigid circuit graphs
• A Helly theorem for convexity in graphs
• Decomposition by clique separators
• The theory of convex geometries
• Accretion centers: A generalization of branch weight centroids
• Algorithms on clique separable graphs
• Convexity in Graphs and Hypergraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some properties of graph centroids