h1

h2

h3

h4

h5
h6

001     188132
005     20240919150946.0
024 7 _ |2 DOI
|a 10.1016/j.dam.2007.03.018
024 7 _ |2 HSB
|a 999910098879
024 7 _ |2 ISSN
|a 0166-218x
024 7 _ |2 SCOPUS
|a SCOPUS:2-s2.0-34547684279
024 7 _ |2 WOS
|a WOS:000249481600005
037 _ _ |a RWTH-CONV-064477
041 _ _ |a English
100 1 _ |0 P:(DE-82)069736
|a Helden, Guido
|b 0
|e Author
|u rwth
111 2 _ |a 3. Cologne/Twente Workshop
|c Lake Como
|d 2004-05-30 - 2004-06-2
|g CTW 2004
|w Italy
245 _ _ |a Each maximal planar graph with exactly two separating triangles is Hamiltonian
|h online, print
260 _ _ |a Amsterdam [u.a.]
|b Elsevier
|c 2007
336 7 _ |0 0
|2 EndNote
|a Journal Article
336 7 _ |0 PUB:(DE-HGF)16
|2 PUB:(DE-HGF)
|a Journal Article
|b journal
|m journal
336 7 _ |0 PUB:(DE-HGF)8
|2 PUB:(DE-HGF)
|a Contribution to a conference proceedings
336 7 _ |2 BibTeX
|a ARTICLE
336 7 _ |2 DRIVER
|a article
336 7 _ |2 DataCite
|a Output Types/Journal article
336 7 _ |2 ORCID
|a JOURNAL_ARTICLE
591 _ _ |a Germany
770 _ _ |a 3rd Cologne/Twente Workshop on Graphs and Combinatorial Optimization - CTW2004, Lake Como, Italy, 30 May–2 June 2004
773 _ _ |0 PERI:(DE-600)1467965-6
|a 10.1016/j.dam.2007.03.018
|n 14
|p 1833-1836
|t Discrete applied mathematics
|v 155
|x 0166-218x
909 C O |o oai:publications.rwth-aachen.de:188132
|p VDB
910 1 _ |0 I:(DE-588b)36225-6
|6 P:(DE-82)069736
|a RWTH Aachen
|b 0
|k RWTH
914 1 _ |y 2007
915 1 _ |0 StatID:(DE-HGF)0031
|2 StatID
|a Peer reviewed article
920 1 _ |0 I:(DE-82)114510_20140620
|k 114510
|l Lehrstuhl C für Mathematik
|x 0
920 1 _ |0 I:(DE-82)110000_20140620
|k 110000
|l Fachgruppe Mathematik
|x 1
970 _ _ |a hsb999910098879
980 _ _ |a ConvertedRecord
980 _ _ |a I:(DE-82)110000_20140620
980 _ _ |a I:(DE-82)114510_20140620
980 _ _ |a UNRESTRICTED
980 _ _ |a VDB
980 _ _ |a contrib
980 _ _ |a journal

LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21