Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

COMPLEXITY OF REPRESENTATION OF GRAPHS BY SET SYSTEMS

Author
POLJAK S; RODL V; TURZIK D
KZAA/PRAHA 180000/CSK
Source
DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 4; PP. 301-312; BIBL. 15 REF.
Document type
Article
Language
English
Keyword (fr)
THEORIE GRAPHE REPRESENTATION THEORIE ENSEMBLE PROBLEME NP COMPLET MATHEMATIQUES APPLIQUEES
Keyword (en)
GRAPH THEORY REPRESENTATION SET THEORY NP COMPLETE PROBLEM 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
PASCAL8130504265

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