On upper bound graphs with respect to operations on graphs

DOI10.1016/S0304-3975(99)00194-2zbMath0938.68060OpenAlexW2033364482MaRDI QIDQ1978708

Hiroshi Era, Kenjiro Ogawa, Morimasa Tsuchiya

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00194-2

zbMATH Keywords

posetsgraph operationsupper bound graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Upper maximal graphs of posets ⋮ A note on chordal bound graphs and posets ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers

Cites Work

• Parallel concepts in graph theory
• On upper bound graphs whose complements are also upper bound graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: On upper bound graphs with respect to operations on graphs