Homomorphism theorems for graphs

From MaRDI portal
Revision as of 10:22, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2625679

DOI10.1007/BF01361708zbMath0115.41005OpenAlexW2052409046WikidataQ63406264 ScholiaQ63406264MaRDI QIDQ2625679

G. A. Dirac

Publication date: 1963

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

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




Related Items (37)

Cliques in graphs excluding a complete graph minorDirac's conjecture on \(K_ 5\)-subdivisions$K_5^-$-Subdivision in 4-Connected GraphsSubdivisions in planar graphsThe extremal function for disconnected minorsNew exact values of the maximum size of graphs free of topological complete subgraphsSimplicial decompositions of graphs: A survey of applicationsHadwiger's conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphsTournaments as strong subcontractionsColoring graphs with forbidden minorsGraphs without minor complete subgraphsSpecial subdivisions of \(K_4\) and 4-chromatic graphsLocally Hamiltonian graphs and minimal size of maximal graphs on a surfaceA lower bound on the average degree forcing a minorStrong chromatic index and Hadwiger numberPhase transition of degeneracy in minor-closed familiesRecent progress towards Hadwiger's conjectureThe spectral radius of minor-free graphsForcing a sparse minorÜber endliche Graphen mit vorgegebenen Homomorphieeigenschaften. (On finite graphs with prescribed homotopy properties)Asymptotic density of graphs excluding disconnected minorsThe extremal function for Petersen minorsSaturation numbers for families of graph subdivisionsThe extremal function for \(K_{9}\) minorsWhat is on his mind?Rigidity and the lower bound theorem. IMinors in Graphs with High Chromatic NumberOmomorfismi fra grafi e grafi moltiplicativiZur Klassifikation der endlichen Graphen nach H. Hadwiger und K. WagnerHomomorphiesätze für GraphenHomomorphieeigenschaften und mittlere Kantendichte von GraphenK5-Subdivisions in GraphsA minimal condition implying a special K\(_4\)-subdivision in a graphThe Kelmans-Seymour conjecture. IV: A proofThe extremal function for complete minorsSTRUCTURE OF THE EXTREMAL FAMILY EX(n;TKp)Extremal functions for sparse minors




Cites Work




This page was built for publication: Homomorphism theorems for graphs