Homomorphiesätze für Graphen

From MaRDI portal

Publication:2530192

Jump to:navigation, search

DOI10.1007/BF01350657zbMath0165.57401OpenAlexW1989340449WikidataQ56431018 ScholiaQ56431018MaRDI QIDQ2530192

Publication date: 1968

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/161741

zbMATH Keywords

Related Items

Recent progress towards Hadwiger's conjecture, The extremal functions for triangle-free graphs with excluded minors, On the critical densities of minor-closed classes, How to catch marathon cheaters: new approximation algorithms for tracking paths, Tree densities in sparse graph classes, The complement problem for linklessly embeddable graphs, Minors in graphs of large girth, On a relationship between Hadwiger and stability numbers, Cliques in graphs excluding a complete graph minor, Small complete minors above the extremal edge density, Minimum Degree and Graph Minors, Some remarks on even-hole-free graphs, On the Hadwiger's conjecture for graph products, Polytopes, graphs, and complexes, The extremal function for disconnected minors, On the number of cliques in graphs with a forbidden minor, \(K_7\)-minors in optimal 1-planar graphs, Hadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs, Forbidden graphs for degree and neighbourhood conditions, Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait, Zero-sum problems -- a survey, Tournaments as strong subcontractions, Coloring graphs with forbidden minors, Some recent progress and applications in graph minor theory, Graphs without minor complete subgraphs, Random graphs from a weighted minor-closed class, The edge-density for \(K_{2,t}\) minors, On the number of edges in maximally linkless graphs, Edge‐maximal graphs on orientable and some nonorientable surfaces, A lower bound on the average degree forcing a minor, Complete minors and average degree: A short proof, Clique minors in graphs with a forbidden subgraph, Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth, On the extremal function for graph minors, Maximal knotless graphs, Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant, A decomposition method on solving the linear arboricity conjecture, Bipartite graphs with no \(K_6\) minor, Grad and classes with bounded expansion. I: Decompositions, New bounds on maximal linkless graphs, Detecting minors in matroids through triangles, Linkless and flat embeddings in 3-space, Optimal 1-planar multigraphs, Phase transition of degeneracy in minor-closed families, A note on odd colorings of 1-planar graphs, Treewidth, Circle Graphs, and Circular Drawings, Small minors in dense graphs, Graph theory. Abstracts from the workshop held January 2--8, 2022, Forcing a sparse minor, Properties of 8-contraction-critical graphs with no \(K_7\) minor, A unified approach to distance-two colouring of graphs on surfaces, Über endliche Graphen mit vorgegebenen Homomorphieeigenschaften. (On finite graphs with prescribed homotopy properties), On the purity of minor-closed classes of graphs, Asymptotic density of graphs excluding disconnected minors, Non-separating planar graphs, The isomorphism problem for classes of graphs closed under contraction, Order nine MMIK graphs, Random Graphs from a Minor-Closed Class, Disjoint unions of complete minors, On the links of vertices in simplicial \(d\)-complexes embeddable in the Euclidean \(2d\)-space, On embeddability and stresses of graphs, Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph, The extremal function for Petersen minors, Linear transformations between dominating sets in the TAR-model, Random graphs containing few disjoint excluded minors, Ramsey numbers of cubes versus cliques, The extremal function and Colin de Verdière graph parameter, The Colin de Verdière parameter, excluded minors, and the spectral radius, Minors in ‐ Chromatic Graphs, II, Logarithmically small minors and topological minors, Disjoint \(K_{r}\)-minors in large graphs with given average degree, On the structure of \(k\)-connected graphs without \(K_{k}\)-minor, The extremal function for \(K_{9}\) minors, An extremal function for contractions of graphs, Bipartite rigidity, Graph theory, On vertex partitions and some minor-monotone graph parameters, Simple graphs of order 12 and minimum degree 6 contain \(K_6\) minors, On the odd-minor variant of Hadwiger's conjecture, Most graphs are knotted, Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density, Local algorithms for sparse spanning graphs, Hadwiger number and the Cartesian product of graphs, Hadwiger’s Conjecture, Linear connectivity forces large complete bipartite minors, Lower bound of the Hadwiger number of graphs by their average degree, Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte, Long paths and cycles in random subgraphs of graphs with large minimum degree, Cliques, minors and apex graphs, 1-Planar Graphs, On the maximum density of graphs which have no subcontraction to \(K^ r\)., The extremal function for \(K_{8}^{-}\) minors, On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion, On the edge numbers of graphs with Hadwiger number 4 and 5, Surfaces, tree-width, clique-minors, and partitions, The extremal function for complete minors, Hadwiger's conjecture for \(K_ 6\)-free graphs, Circumference and Pathwidth of Highly Connected Graphs, Extremal functions for sparse minors, Average degree conditions forcing a minor

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2530192&oldid=15259261"