The solution of two problems on bound polysemy

DOI10.1016/J.DISC.2003.12.010MaRDI QIDQ1827754zbMATH OpenOpenAlexFDO

Authors Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach

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)

Recommendations

• Bound graph polysemy
• Upper bound multigraphs for posets
• Competition polysemy
• A characterization of semi bound graphs
• Publication:5750898

Cites work

• scientific article; zbMATH DE number 3831999 (Why is no real title available?)
• scientific article; zbMATH DE number 4093496 (Why is no real title available?)
• scientific article; zbMATH DE number 4103134 (Why is no real title available?)
• scientific article; zbMATH DE number 830463 (Why is no real title available?)
• scientific article; zbMATH DE number 4185661 (Why is no real title available?)
• Bound graph polysemy
• On upper bound graphs whose complements are also upper bound graphs
• Some uniqueness results for upper bound graphs
• Topics in Intersection Graph Theory

Cited in

(1)

• On competition polysemy and \(m\)-competition polysemy.

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

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