On upper bound graphs with respect to operations on graphs

DOI10.1016/S0304-3975(99)00194-2zbMATH Open0938.68060OpenAlexW2033364482MaRDI QIDQ1978708FDOQ1978708

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

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

zbMATH Keywords

posetsgraph operationsupper bound graphs

Mathematics Subject Classification ID

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

Cites Work

• Parallel concepts in graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• On upper bound graphs whose complements are also upper bound graphs

Cited In (8)

• Title not available (Why is that?)
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• On upper bound graphs with respect to unary operations on graphs
• On some graph operations and related applications
• Upper maximal graphs of posets
• A note on chordal bound graphs and posets
• Note on construction methods of upper bound graphs
• Title not available (Why is that?)

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)