Some uniqueness results for upper bound graphs

DOI10.1016/0012-365X(83)90199-1zbMath0518.05052OpenAlexW1994160703MaRDI QIDQ1053714

G. T. Mejers, Fred 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)

Related Items (5)

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

Cites Work

• Graphs which, with their complements, have certain clique covering numbers
• Uniquely intersectable graphs
• Unnamed Item
• Unnamed Item

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