Highly linked graphs
From MaRDI portal
Publication:2563507
DOI10.1007/BF01261316zbMath0870.05044OpenAlexW1969919767MaRDI QIDQ2563507
Béla Bollobás, Andrew G. Thomason
Publication date: 15 September 1997
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01261316
Related Items
The \(k\)-subconnectedness of planar graphs, Rooted minor problems in highly connected graphs, Linkage for the diamond and the path with four vertices, Small complete minors above the extremal edge density, A new upper bound on the chromatic number of graphs with no odd \(K_t\) minor, Nonseparating Cycles Avoiding Specific Vertices, On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture, Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments, On Modulo Linked Graphs, Some recent progress and applications in graph minor theory, Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs, On the maximum degree of path-pairable planar graphs, Disjoint isomorphic balanced clique subdivisions, Cycle lengths in randomly perturbed graphs, A minimum degree condition forcing a digraph to be k-linked, A graph minor condition for graphs to be \(k\)-linked, Topological minors in graphs of large girth, How to build a pillar: a proof of Thomassen's conjecture, The linkedness of cubical polytopes: beyond the cube, Optimal connectivity for fat-triangle linkages, Recent progress towards Hadwiger's conjecture, The extremal function for unbalanced bipartite minors, On linkedness in the Cartesian product of graphs, Local Conditions for Exponentially Many Subdivisions, Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor, Subdivisions of digraphs in tournaments, Linkedness and Ordered Cycles in Digraphs, Linked graphs with restricted lengths, Highly linked tournaments, An improved linear connectivity bound for tournaments to be highly linked, The extremal function for 3-linked graphs, Linkability in iterated line graphs, An improved linear edge bound for graph linkages, Forcing unbalanced complete bipartite minors, Non-zero disjoint cycles in highly connected group labelled graphs, Characterization of \(k\)-subconnected graphs, On 1-factors with prescribed lengths in tournaments, 7-connected graphs are 4-ordered, On the maximum diameter of path-pairable graphs, Graph minor theory, Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture, The linkedness of cubical polytopes: the cube, Linear connectivity forces large complete bipartite minors, \((2k+1)\)-connected tournaments with large minimum out-degree are \(k\)-linked, Minimum degree condition for a graph to be knitted, Hamiltonian Extension, Highly linked tournaments with large minimum out-degree, Subdivisions of transitive tournaments, Connectivity for Kite-Linked Graphs, \(K_{a,k}\) minors in graphs of bounded tree-width
Cites Work
- Disjoint paths in graphs
- 2-linked graphs
- A sufficient condition for graphs to be weakly \(k\)-linked
- Highly connected non-2-linked digraphs
- Graph minors. XIII: The disjoint paths problem
- Homomorphieeigenschaften und mittlere Kantendichte von Graphen
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- An extremal function for contractions of graphs
- On the Computational Complexity of Combinatorial Problems
- Topological Cliques in Graphs
- Topological cliques in graphs II
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- Hinreichende Bedingungen für die Existenz von Teilgraphen, die zu einem vollständigen Graphen homöomorph sind
- Unnamed Item
- Unnamed Item
