On upper bound graphs with respect to operations on graphs

DOI10.1016/S0304-3975(99)00194-2MaRDI QIDQ1978708zbMATHOpenAlexFDO

Authors 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)

Recommendations

• On upper bound graphs with respect to unary operations on graphs
• scientific article; zbMATH DE number 1786510
• On upper bound graphs with edge operations
• On upper bound graphs whose complements are also upper bound graphs
• On upper bound graphs with respect to line graphs

Cites work

• scientific article; zbMATH DE number 3831999 (Why is no real title available?)
• scientific article; zbMATH DE number 3706451 (Why is no real title available?)
• On upper bound graphs whose complements are also upper bound graphs
• Parallel concepts in graph theory

Cited in

(8)

• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• scientific article; zbMATH DE number 907923 (Why is no real title available?)
• scientific article; zbMATH DE number 1786510 (Why is no real title available?)
• On upper bound graphs with respect to unary operations on graphs
• Note on construction methods of upper bound graphs
• A note on chordal bound graphs and posets
• On some graph operations and related applications
• Upper maximal graphs of posets

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

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