On upper bound graphs whose complements are also upper bound graphs

DOI10.1016/S0012-365X(97)00048-4zbMath0906.05034MaRDI QIDQ1377711

Morimasa Tsuchiya, Hiroshi Era

Publication date: 26 January 1998

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

zbMATH Keywords

characterizationposetsdouble bound graphsupper bound graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (6)

Upper maximal graphs of posets ⋮ On upper bound graphs with respect to operations on graphs ⋮ A note on chordal bound graphs and posets ⋮ On distance two graphs of upper bound graphs ⋮ The solution of two problems on bound polysemy ⋮ The numbers of shared upper bounds determine a poset

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On upper bound graphs whose complements are also upper bound graphs