Graph Minors. XVI. Excluding a non-planar graph

Author： Robertson N.   Seymour P.D.  

Publisher： Elsevier

ISSN： 0095-8956

Source： Journal of Combinatorial Theory, Series B, Vol.89, Iss.1, 2003-09, pp. : 43-76

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Untangling a Planar Graph

By Goaoc Xavier   Kratochvíl Jan   Okamoto Yoshio   Shin Chan-Su   Spillner Andreas   Wolff Alexander  

Discrete & Computational Geometry, Vol. 42, Iss. 4, 2009-12 ,pp. : 542-569

Springer Publishing Company

Access to resources Recommend Favorite

Graph Minors. XVIII. Tree-decompositions and well-quasi-ordering

By Robertson N.   Seymour P.  

Journal of Combinatorial Theory, Series B, Vol. 89, Iss. 1, 2003-09 ,pp. : 77-108

Elsevier

Access to resources Recommend Favorite

Extending partial 3-colourings in a planar graph

By DeVos M.   Seymour P.  

Journal of Combinatorial Theory, Series B, Vol. 88, Iss. 2, 2003-07 ,pp. : 219-225

Elsevier

Access to resources Recommend Favorite

A Replacement Algorithm of Non-Maximum Suppression Base on Graph Clustering

By  

ITM Web of conferences, Vol. 12, Iss. issue, 2017-09 ,pp. : 05006-05006

Edp Sciences

Access to resources Recommend Favorite

Dynamics of a viscous thread on a non-planar substrate

By Bowen Mark  

Journal of Engineering Mathematics, Vol. 80, Iss. 1, 2013-06 ,pp. : 39-62

Springer Publishing Company

Access to resources Recommend Favorite