Convex Independence in Permutation Graphs

DOI10.1007/978-3-319-48749-6_52zbMath1486.05259arXiv1609.02657OpenAlexW2519964588MaRDI QIDQ2958358

Wing-Kai Hon, Hsiang-Hsuan Liu, Fu-Hong Liu, Ton Kloks

Publication date: 1 February 2017

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1609.02657

zbMATH Keywords

Caratheodory number\(\text{P}_3\)-convexity

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
• The theory of convex geometries
• Convex sets in graphs. II: Minimal path convexity
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• Convexly independent sets
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Some Results on Order-Convexity
• On the Carathéodory Number for the Convexity of Paths of Order Three
• Partial orders of dimension 2
• Partially Ordered Sets

This page was built for publication: Convex Independence in Permutation Graphs