000129187 001__ 129187
000129187 005__ 20190316234421.0
000129187 0247_ $$2doi$$a10.1007/BF01305955
000129187 037__ $$aARTICLE
000129187 245__ $$aThe complexity of a class of infinite graphs
000129187 269__ $$a1994
000129187 260__ $$c1994
000129187 336__ $$aJournal Articles
000129187 500__ $$aProfessor Pach's number: [088]
000129187 6531_ $$auniversal graphs
000129187 6531_ $$avertex-disjoint cycles
000129187 6531_ $$aedge-disjoint cycles
000129187 700__ $$aKomjáth, Péter
000129187 700__ $$g183120$$aPach, János$$0243577
000129187 773__ $$j14$$tCombinatorica$$k1$$q121-125
000129187 8564_ $$zURL
000129187 8564_ $$uhttps://infoscience.epfl.ch/record/129187/files/kope.ps$$zn/a$$s83194
000129187 909C0 $$xU11887$$0252234$$pDCG
000129187 909CO $$qGLOBAL_SET$$pSB$$ooai:infoscience.tind.io:129187$$particle
000129187 937__ $$aDCG-ARTICLE-1994-003
000129187 973__ $$rREVIEWED$$sPUBLISHED$$aOTHER
000129187 970__ $$a0795.05121/DCG
000129187 980__ $$aARTICLE