Abstract
The present paper is the first one in the sequence of papers about a simple class of {\em framed -graphs}; the goal of the present paper is to collect some well-known results on planarity and to reformulate them in the language of {\em minors}. The goal of the whole sequence is to prove analogues of the Robertson-Seymour-Thomas theorems for framed -graphs: namely, we shall prove that many minor-closed properties are classified by finitely many excluded graphs. From many points of view, framed -graphs are easier to consider than general graphs; on the other hand, framed -graphs are closely related to many problems in graph theory.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.