REAL

Depth first search in claw-free graphs

Wiener, Gábor (2016) Depth first search in claw-free graphs. In: JCDCGGG 2016, Tokió.

[img]
Preview
Text
clawfree.pdf

Download (194Kb) | Preview

Abstract

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.

Item Type: Conference or Workshop Item (Lecture)
Subjects: Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet
Q Science / természettudomány > QA Mathematics / matematika > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Depositing User: Dr. Gábor Wiener
Date Deposited: 29 Sep 2016 12:53
Last Modified: 29 Sep 2016 12:53
URI: http://real.mtak.hu/id/eprint/40508

Actions (login required)

View Item View Item