The Go polynomials of a graph

Author： Farr G.E.  

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 1-18

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

Specifying Knowledge Graph with Data Graph, Information Graph, Knowledge Graph, and Wisdom Graph

By  

International Journal of Software Innovation (IJSI), Vol. 6, Iss. 2, 2018-04 ,pp. : 10-25

IGI Global_journal

Access to resources Recommend Favorite

Graph Grammars for Querying Graph-like Data

By Flesca S.   Furfaro F.   Greco S.  

Electronic Notes in Theoretical Computer Science, Vol. 50, Iss. 3, 2004-01 ,pp. : 1-10

Elsevier

Access to resources Recommend Favorite

A necessary condition for a graph to be the visibility graph of a simple polygon

By Chen C.  

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 417-424

Elsevier

Access to resources Recommend Favorite

A new definition of the Adomian polynomials

By Rach Randolph C.  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 37, Iss. 7, 2008-09 ,pp. : 910-955

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

The parametrized complexity of knot polynomials

By Makowsky J.A.   Marino J.P.  

Journal of Computer and System Sciences, Vol. 67, Iss. 4, 2003-12 ,pp. : 742-756

Elsevier

Access to resources Recommend Favorite