The solution of two problems on bound polysemy

DOI10.1016/J.DISC.2003.12.010zbMath1042.05069OpenAlexW2130146230MaRDI QIDQ1827754

Dieter Rautenbach, Werner Knoben, Miranca Fischermann, Dirk Kremer

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.12.010

zbMATH Keywords

PosetCliqueBound graphPolysemic pairPolysemy

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Some uniqueness results for upper bound graphs
• On upper bound graphs whose complements are also upper bound graphs
• Bound graph polysemy
• Topics in Intersection Graph Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The solution of two problems on bound polysemy