most citedOn the structure of graphs with path-width at most two

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing math.COShow all

2 papers · 1 filter

math.CO2009★ 2 cited

On the structure of graphs with path-width at most two

János Barát, Péter Hajnal, Yixun Lin +1

Nancy G. Kinnersley and Michael A. Langston has determined the excluded minors for the class of graphs with path-width at most two by computer. Their list consisted of 110 graphs.…

math.CO2009

Elementary proof techniques for the maximum number of islands

János Barát, Péter Hajnal, Eszter K. Horváth

Islands are combinatorial objects that can be intuitively defined on a board consisting of a finite number of cells. Based on the neighbor relation of the cells, it is a fundamenta…