Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=PASCAL8130438900

COMPLEXITY OF GRAPH EMBEDDABILITY PROBLEMS

Author
BENZAKEN C; FOLDES S
UNIV. SCI. MED., IMAG/GRENOBLE 38041/FRA
Source
THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 15; NO 3; PP. 321-328; BIBL. 8 REF.
Document type
Article
Language
English
Keyword (fr)
THEORIE GRAPHE GRAPHE PLANAIRE PLONGEMENT GRAPHE MATHEMATIQUES APPLIQUEES
Keyword (en)
GRAPH THEORY PLANAR GRAPH APPLIED MATHEMATICS
Keyword (es)
MATEMATICAS APPLICADAS
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
PASCAL8130438900

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Searching the Web