Depth first search in claw-free graphs (NDA@SZTAKI, Nemzeti Digitális Adattár, National Digital Data Archive)

Tartalom:	http://real.mtak.hu/40508/
Archívum:	MTA Könyvtár
Gyûjtemény:	Status = Published Type = Conference or Workshop Item
Cím:	Depth first search in claw-free graphs
Létrehozó:	Wiener, GÃ¡bor
Dátum:	2016
Téma:	QA166-QA166.245 Graphs theory / grÃ¡felmÃ©let QA75 Electronic computers. Computer science / szÃ¡mÃtÃ¡stechnika, szÃ¡mÃtÃ³gÃ©ptudomÃ¡ny
Tartalmi leírás:	We prove that all claw-free graphs have a DFS-tree, such that the leaves different from the root have no common neighbour. This generalizes a theorem of Kano, Kyaw, Matsuda, Ozeki, Saito, and Yamashita and also implies a strengthening of a result of Ainouche, Broersma, and Veldman.
Nyelv:	magyar
Típus:	Conference or Workshop Item PeerReviewed info:eu-repo/semantics/conferenceObject
Formátum:	text
Azonosító:	http://real.mtak.hu/40508/1/clawfree.pdf Wiener, GÃ¡bor (2016) Depth first search in claw-free graphs. In: JCDCGGG 2016, TokiÃ³.
Kapcsolat:	http://real.mtak.hu/40508/