scientific article; zbMATH DE number 3311627
From MaRDI portal
Publication:5592127
zbMath0195.54103MaRDI QIDQ5592127
No author found.
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (32)
Unnamed Item ⋮ On a pursuit game played on graphs for which a minor is excluded ⋮ Unnamed Item ⋮ The max-cut problem on graphs not contractible to \(K_ 5\) ⋮ About graph complements ⋮ About graph sums ⋮ Inequalities for the chromatic numbers of graphs ⋮ Planarity and duality of finite and infinite graphs ⋮ Sensitivitätsindices für Knoten und Kanten eines Netzes ⋮ [https://portal.mardi4nfdi.de/wiki/Publication:5675574 Unverschr�nkte Graphen und strategische Spiele in kombinatorischer Form] ⋮ A graph-theoretical approach to a plotter pen touring problem ⋮ Über endliche Graphen mit vorgegebenen Homomorphieeigenschaften. (On finite graphs with prescribed homotopy properties) ⋮ Borsuk's partition problem and finite point sets ⋮ Compositions in the bipartite subgraph polytope ⋮ Zum Basisproblem der nicht in die projektive Ebene einbettbaren Graphen. II ⋮ MacLane's planarity criterion for locally finite graphs ⋮ Graph minors. XX: Wagner's conjecture ⋮ Locally finite graphs with ends: A topological approach. II: Applications ⋮ S-functions for graphs ⋮ Über eine Eigenschaft lokalfiniter, unendlicher Bäume. (On a property of locally finite infinite trees) ⋮ Unnamed Item ⋮ Graph minor theory ⋮ Underlying simple graphs ⋮ About supergraphs. I ⋮ About supergraphs. II ⋮ The parallel complexity of approximating the high degree subgraph problem ⋮ On the Sperner lemma and some colorings of graphs ⋮ About supergraphs. III ⋮ Zur Einbettbarkeit von Graphen in den Torus ⋮ Minimal n-fach zusammenhängende Digraphen. (Minimally n-connected digraphs) ⋮ Refined finiteness and degree properties in graphs ⋮ About graph unions and intersections
This page was built for publication:
