2 citations · 2 across the 2 of their papers we have counts for
2 papers
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
Towards The Albertson Conjecture
János Barát, Géza Tóth
Albertson conjectured that if a graph has chromatic number then its crossing number is at least as much as the crossing number of . Albertson, Cranston, and Fox verifi…