Title of article :
Graph Minors. XX. Wagnerʹs conjecture
Author/Authors :
Robertson، نويسنده , , Neil and Seymour، نويسنده , , P.D.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
Abstract :
We prove Wagnerʹs conjecture, that for every infinite set of finite graphs, one of its members is isomorphic to a minor of another.
Keywords :
Minor , surface embedding , Well-quasi-ordering , graph
Journal title :
Journal of Combinatorial Theory Series B
Journal title :
Journal of Combinatorial Theory Series B
