scientific article; zbMATH DE number 475621
From MaRDI portal
Publication:4273877
zbMath0797.05038MaRDI QIDQ4273877
Publication date: 10 October 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)
Related Items
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, Layered separators in minor-closed graph classes with applications, Some recent progress and applications in graph minor theory, \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions, Unnamed Item, \textsc{max-cut} and containment relations in graphs, The theory of guaranteed search on graphs, A successful concept for measuring non-planarity of graphs: The crossing number., Induced minors and well-quasi-ordering, Counting the number of perfect matchings in \(K_{5}\)-free graphs, Unnamed Item, max-cut and Containment Relations in Graphs, Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction, Linear connectivity forces large complete bipartite minors, A partial k-arboretum of graphs with bounded treewidth, NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs, Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs
