Über eine Eigenschaft der ebenen Komplexe
From MaRDI portal
Publication:2645755
DOI10.1007/BF01594196zbMath0017.19005WikidataQ55878067 ScholiaQ55878067MaRDI QIDQ2645755
Publication date: 1937
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/159935
Related Items
A Bernstein inequality for exponentially growing graphs, Random Walks and Forbidden Minors II: A $\mathrm{poly}(d\varepsilon^{-1})$-Query Tester for Minor-Closed Properties of Bounded-Degree Graphs, Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths, Labelled well-quasi-order for permutation classes, A Basic Parameterized Complexity Primer, -Minors in triangulations on surfaces, Minimum Degree and Graph Minors, Density of Chromatic Roots in Minor-Closed Graph Families, Bipartite Rigidity, Polynomial-time self-reducibility: theoretical motivations and practical results∗, The minor minimal intrinsically chiral graphs, A short proof of the non-biplanarity of $K_9$, Properties of Large 2-Crossing-Critical Graphs, The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues, Unnamed Item, The structure of graphs with no K3,3 immersion, Parameterized algorithms and data reduction for the short secluded s‐t‐path problem, Clique minors in graphs with a forbidden subgraph, Growth and cogrowth of normal subgroups of a free group, The structure of graphs with no W4 immersion, Tangle bases: Revisited, Weakening total coloring conjecture and Hadwiger's conjecture on total graphs, The ratio of the numbers of odd and even cycles in outerplanar graphs, Strengthening Hadwiger's conjecture for 4- and 5-chromatic graphs, Bipartite graphs with no \(K_6\) minor, Excluding a planar matching minor in bipartite graphs, Unnamed Item, Local Hadwiger's conjecture, Refined List Version of Hadwiger’s Conjecture, Optimal 1-planar multigraphs, Finding geometric representations of apex graphs is \textsf{NP}-hard, Thin Loewner Carpets and Their Quasisymmetric Embeddings in S2, On strict brambles, Unnamed Item, The spectral radius of minor-free graphs, The monadic second-order logic of graphs : Definable sets of finite graphs, Non-planarity of Markoff graphs \(\mod p\), Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor, A counter-example to ‘Wagner's conjecture’ for infinite graphs, Model Reductions for Inference: Generality of Pairwise, Binary, and Planar Factor Graphs, Nerves, minors, and piercing numbers, Excluding Minors in Cubic Graphs, Characterization of groups with planar, toroidal or projective planar (proper) reduced power graphs, The 𝐾_{𝑛+5} and 𝐾_{3²,1ⁿ} families and obstructions to 𝑛-apex., Simplicial minors and decompositions of graphs, FEYNMAN GRAPH POLYNOMIALS, Logarithmically small minors and topological minors, Unnamed Item, Bipartite rigidity, Invertibility of graph translation and support of Laplacian Fiedler vectors, A Weakening of the Odd Hadwiger's Conjecture, Minors in Graphs with High Chromatic Number, PARTIAL RESULT ON HADWIGER'S CONJECTURE, INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES, On the signless Laplacian spectral radius of Ks,t-minor free graphs, Optimization and Recognition for K 5-minor Free Graphs in Linear Time, THE CLIQUE MINOR OF GRAPHS WITH INDEPENDENCE NUMBER TWO, Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs, A Characterization of Almost-Planar Graphs, NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs, Graph Pattern Detection: Hardness for all Induced Patterns and Faster Noninduced Cycles, Unnamed Item, Forbidden minors and subdivisions for toroidal graphs with no K3,3's, TAMING THE INCOMPUTABLE, RECONSTRUCTING THE NONCONSTRUCTIVE AND DECIDING THE UNDECIDABLE IN MATHEMATICAL ECONOMICS, Bicircular matroids are 3-colorable, Clique-coloring of \(K_{3,3}\)-minor free graphs, Regularity and planarity of token graphs, The projective-planar signed graphs, Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant, Homomorphism theorems for graphs, An extension of Thomassen's result on choosability, Graph theory -- a survey on the occasion of the Abel Prize for László Lovász, A note on the Hadwiger number of circular arc graphs, Nonconstructive advances in polynomial-time complexity, Bounded face-width forces \(K_7\)-minors in orientable surfaces, A minor-monotone graph parameter based on oriented matroids, Coloring immersion-free graphs, The structure of graphs not topologically containing the Wagner graph, Supereulerian graphs and excluded induced minors, On a new reformulation of Hadwiger's conjecture, Some remarks on even-hole-free graphs, Primität und Homomorphie von ebenen Dreiecksgraphen, Hadwiger's conjecture for circular colorings of edge-weighted graphs, On the Hadwiger's conjecture for graph products, Excluding Kuratowski graphs and their duals from binary matroids, Truncated metric dimension for finite graphs, Distributed minimum dominating set approximations in restricted families of graphs, Simplicial decompositions of graphs: A survey of applications, Hilbert bases of cuts, Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs, Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees, Transforms and minors for binary functions, Graph \(r\)-hued colorings -- a survey, Tournaments as strong subcontractions, The thickness of a minor-excluded class of graphs, Generalized cut and metric polytopes of graphs and simplicial complexes, Dichotomies properties on computational complexity of \(S\)-packing coloring problems, Coloring graphs with forbidden minors, Layered separators in minor-closed graph classes with applications, Hadwiger numbers of self-complementary graphs, Treewidth and gonality of glued grid graphs, Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets, Barycentric systems and stretchability, Six variations on a theme: almost planar graphs, Hadwiger's conjecture for graphs on the Klein bottle, Bipartite minors, Approximation algorithms via contraction decomposition, On the construction of graphs with a planar bipartite double cover from Boolean formulas and its application to counting satisfying solutions, Coloring algorithms for \(K_ 5\)-minor free graphs, Large minors in graphs with given independence number, Tree-width, clique-minors, and eigenvalues., On structural descriptions of lower ideals of series parallel posets, On quasi-strongly regular graphs with parameters \(( n , k , a ; k - 1 , c_2 )\), Delta-wye reduction of almost-planar graphs, A search problem on graphs which generalizes some group testing problems with two defectives, Another proof of the 5-choosability of \(K_5\)-minor-free graphs, Trees of tangles in abstract separation systems, On cyclically orientable graphs, Hadwiger's conjecture for inflations of 3-chromatic graphs, Displaying blocking pairs in signed graphs, Root bundles and towards exact matter spectra of F-theory MSSMs, Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\), Odd complete minors in even embeddings on surfaces, A note on immersion minors and planarity, Decomposing infinite graphs, The extremal function for Petersen minors, On Hadwiger's number---A problem of the Nordhaus-Gaddum type, A new proof of the flat wall theorem, Compositions in the bipartite subgraph polytope, The minimal \(\mathbb{Z}_n\)-symmetric graphs that are not \(\mathbb{Z}_n\)-spherical, DNA walker circuits: computational potential, design, and verification, Ideal clutters, The Möbius matroids, The edge colorings of \(K_5\)-minor free graphs, The intersection graph of the disks with diameters the sides of a convex \(n\)-gon, Planar graphs are \(9/2\)-colorable, The connected metric dimension at a vertex of a graph, Contractions of graphs: A theorem of Ore and an extremal problem, Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem, The edge version of Hadwiger's conjecture, Zur Klassifikation der endlichen Graphen nach H. Hadwiger und K. Wagner, Clique-sums, tree-decompositions and compactness, Notes on tree- and path-chromatic number, Über einen Satz von K.Wagner zum Vierfarbenproblem, The complexity of the vertex-minor problem, The obstructions for toroidal graphs with no \(K_{3,3}\)'s, List-coloring graphs without \(K_{4,k}\)-minors, Coloring drawings of graphs, Subdivisional spaces and graph braid groups, A polynomial bound for untangling geometric planar graphs, Cliques, minors and apex graphs, Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor, Chirality for simple graphs of size up to 12, The characterization of graphs with no 2-connected spanning subgraph of \(V_8\) as a minor, Choosability of \(K_5\)-minor-free graphs, Colouring non-even digraphs, Variations on a theme of Kuratowski, On regular matroids without certain minors, On the problem of finding small subdivision and homomorphism bases for classes of countable graphs, A note on partial 3-trees and homomorphism bases of graphs, Klaus Wagner 1910-2000, Tuza's conjecture for graphs with maximum average degree less than 7, Counting cliques in 1-planar graphs, A family of efficient six-regular circulants representable as a Kronecker product
