Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
From MaRDI portal
Publication:2545698
DOI10.1007/BF02993903zbMath0215.33803MaRDI QIDQ2545698
Publication date: 1972
Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)
Related Items (56)
On partitions of graphs under degree constraints ⋮ n-connectedness in pure 2-complexes ⋮ Graphs and digraphs with given girth and connectivity ⋮ An extremal problem in subconnectivity ⋮ Unnamed Item ⋮ Graph decomposition with constraints in the minimum degree ⋮ A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor ⋮ On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture ⋮ An improved bound for the monochromatic cycle partition number ⋮ The spectral radius of graphs with no \(k_{2,t}\) minor ⋮ Some recent progress and applications in graph minor theory ⋮ Induced paths in 5-connected graphs ⋮ Disjoint isomorphic balanced clique subdivisions ⋮ Cycle lengths in randomly perturbed graphs ⋮ The mod k $k$ chromatic index of graphs is O(k) $O(k)$ ⋮ Weak saturation number of a complete bipartite graph ⋮ On the number of edges in a graph with no \((k + 1)\)-connected subgraphs ⋮ Subgraphs of large connectivity and chromatic number ⋮ Highly Connected Subgraphs with Large Chromatic Number ⋮ Forbidden rainbow subgraphs that force large monochromatic or multicolored \(k\)-connected subgraphs ⋮ On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs ⋮ Recent progress towards Hadwiger's conjecture ⋮ Non-separating subgraphs in highly connected graphs ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Forcing a sparse minor ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor ⋮ A note on the saturation number of the family of \(k\)-connected graphs ⋮ Finding densest \(k\)-connected subgraphs ⋮ A weaker version of Lovász' path removal conjecture ⋮ Highly connected subgraphs of graphs with given independence number ⋮ Highly connected subgraphs of graphs with given independence number (extended abstract) ⋮ Forcing unbalanced complete bipartite minors ⋮ What is on his mind? ⋮ Openly disjoint circuits through a vertex in regular digraphs ⋮ Isolating Highly Connected Induced Subgraphs ⋮ On a conjecture of Thomassen ⋮ Highly connected multicoloured subgraphs of multicoloured graphs ⋮ Many disjoint dense subgraphs versus large \(k\)-connected subgraphs in large graphs with given edge density ⋮ Highly connected monochromatic subgraphs of multicolored graphs ⋮ Minimale \(n\)-fach kantenzusammenhängende Graphen ⋮ Parity Linkage and the Erdős–Pósa Property of Odd Cycles through Prescribed Vertices in Highly Connected Graphs ⋮ Linear connectivity forces large complete bipartite minors ⋮ Note on coloring graphs without odd-\(K_k\)-minors ⋮ Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs ⋮ Edge-decompositions of highly connected graphs into paths ⋮ Coloring Graphs with Dense Neighborhoods ⋮ Highly linked graphs ⋮ Highly connected coloured subgraphs via the regularity Lemma ⋮ Partition of graphs with condition on the connectivity and minimum degree ⋮ On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs ⋮ Girth in graphs ⋮ \(K_{a,k}\) minors in graphs of bounded tree-width ⋮ Extremal connectivity for topological cliques in bipartite graphs ⋮ Degree and local connectivity in digraphs ⋮ Minimally globally rigid graphs
Cites Work
This page was built for publication: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
