The solution of two problems on bound polysemy

DOI10.1016/J.DISC.2003.12.010zbMATH Open1042.05069OpenAlexW2130146230MaRDI QIDQ1827754FDOQ1827754

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

Recommendations

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

zbMATH Keywords

PosetCliqueBound graphPolysemic pairPolysemy

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Topics in Intersection Graph Theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• On upper bound graphs whose complements are also upper bound graphs
• Title not available (Why is that?)
• Some uniqueness results for upper bound graphs
• Title not available (Why is that?)
• Bound graph polysemy

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)