The arc-width of a graph.
The contractible subgraph of -connected graphs
An edge of a -connected graph is said to be -removable if is still -connected. A subgraph of a -connected graph is said to be -contractible if its contraction results still in a -connected graph. A -connected graph with neither removable edge nor contractible subgraph is said to be minor minimally -connected. In this paper, we show that there is a contractible subgraph in a -connected graph which contains a vertex who is not contained in any triangles. Hence, every vertex of minor...
The minor crossing number of graphs with an excluded minor.
The restricted arc-width of a graph.
Toughness of -minor-free graphs.