Some uniqueness results for upper bound graphs

DOI10.1016/0012-365X(83)90199-1MaRDI QIDQ1053714zbMATH OpenOpenAlexFDO

Authors G. T. Mejers, F. R. McMorris

Publication date 1983

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(83)90199-1

zbMATH Keywords

intersection graphintersection numberupper bound graph

Mathematics Subject Classification ID

Partial orders, general (06A06) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3831999 (Why is no real title available?)
• scientific article; zbMATH DE number 3523606 (Why is no real title available?)
• Graphs which, with their complements, have certain clique covering numbers
• Uniquely intersectable graphs

Cited in

(5)

• The numbers of shared upper bounds determine a poset
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• The solution of two problems on bound polysemy
• \(p\)-competition graphs
• Applications of edge coverings by cliques

This page was built for publication: Some uniqueness results for upper bound graphs

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