On upper bound graphs with respect to operations on graphs

Author： Era H.   Ogawa K.   Tsuchiya M.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.235, Iss.2, 2000-03, pp. : 219-223

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An axiomatization of graphs

By Bozapalidis Symeon   Kalampakas Antonios  

Acta Informatica, Vol. 41, Iss. 1, 2004-11 ,pp. : 19-61

Springer Publishing Company

Access to resources Recommend Favorite

From Existential Graphs to Conceptual Graphs

By  

International Journal of Conceptual Structures and Smart Applications (IJCSSA), Vol. 1, Iss. 1, 2013-01 ,pp. : 39-72

IGI Global_journal

Access to resources Recommend Favorite

On Soft Graphs and Chained Soft Graphs

By  

International Journal of Fuzzy System Applications (IJFSA), Vol. 7, Iss. 2, 2018-04 ,pp. : 85-102

IGI Global_journal

Access to resources Recommend Favorite

Embedding Cartesian Products of Graphs into de Bruijn Graphs

By Andreae T.   Nolle M.   Schreiber G.  

Journal of Parallel and Distributed Computing, Vol. 46, Iss. 2, 1997-11 ,pp. : 194-200

Academic Press

Access to resources Recommend Favorite

Tree Spanners for Bipartite Graphs and Probe Interval Graphs

By Brandstadt Andreas   Dragan Feodor F.   Le Hoang-Oanh   Le Van Bang   Uehara Ryuhei  

Algorithmica, Vol. 47, Iss. 1, 2007-01 ,pp. : 27-51

Springer Publishing Company

Access to resources Recommend Favorite