Linear connectivity forces large complete bipartite minors (Q1026000): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jctb.2008.07.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2166232733
@@ Property / OpenAlex ID: W2166232733 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Disjoint \(K_{r}\)-minors in large graphs with given average degree
+Normal rank
@@ Property / cites work @@
+\(K_{a,k}\) minors in graphs of bounded tree-width
+Normal rank
@@ Property / cites work @@
+Highly linked graphs
@@ Property / cites work: Highly linked graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3999150
@@ Property / cites work: Q3999150 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Highly connected sets and the excluded grid theorem
+Normal rank
@@ Property / cites work @@
+On the excluded minor structure theorem for graphs of large tree-width
+Normal rank
@@ Property / cites work @@
+A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
+Normal rank
@@ Property / cites work @@
+Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem.
+Normal rank
@@ Property / cites work @@
+On the structure of 5- and 6-chromatic abstract graphs.
+Normal rank
@@ Property / cites work @@
+Q5342984
@@ Property / cites work: Q5342984 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5759552
@@ Property / cites work: Q5759552 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5837979
@@ Property / cites work: Q5837979 / rank @@
+Normal rank
@@ Property / cites work @@
+S-functions for graphs
@@ Property / cites work: S-functions for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generating internally four-connected graphs
@@ Property / cites work: Generating internally four-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Contractions to <i>k</i><sub>8</sub>
@@ Property / cites work: Contractions to <i>k</i><sub>8</sub> / rank @@
+Normal rank
@@ Property / cites work @@
+Q2702747
@@ Property / cites work: Q2702747 / rank @@
+Normal rank
@@ Property / cites work @@
+On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
+Normal rank
@@ Property / cites work @@
+Minors in large almost-5-connected non-planar graphs
+Normal rank
@@ Property / cites work @@
+On Sufficient Degree Conditions for a Graph to be $k$-linked
+Normal rank
@@ Property / cites work @@
+Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
+Normal rank
@@ Property / cites work @@
+A relaxed Hadwiger's conjecture for list colorings
+Normal rank
@@ Property / cites work @@
+Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
+Normal rank
@@ Property / cites work @@
+Q3333070
@@ Property / cites work: Q3333070 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bound of the Hadwiger number of graphs by their average degree
+Normal rank
@@ Property / cites work @@
+On \(K_{s,t}\)-minors in graphs with given average degree
+Normal rank
@@ Property / cites work @@
+Forcing unbalanced complete bipartite minors
@@ Property / cites work: Forcing unbalanced complete bipartite minors / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphiesätze für Graphen
@@ Property / cites work: Homomorphiesätze für Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
+Normal rank
@@ Property / cites work @@
+Q4248533
@@ Property / cites work: Q4248533 / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of graphs with no cube minor
@@ Property / cites work: A characterization of graphs with no cube minor / rank @@
+Normal rank
@@ Property / cites work @@
+Q2741176
@@ Property / cites work: Q2741176 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2726740
@@ Property / cites work: Q2726740 / rank @@
+Normal rank
@@ Property / cites work @@
+The extremal function for unbalanced bipartite minors
+Normal rank
@@ Property / cites work @@
+The extremal function for noncomplete minors
@@ Property / cites work: The extremal function for noncomplete minors / rank @@
+Normal rank
@@ Property / cites work @@
+Typical subgraphs of 3- and 4-connected graphs
@@ Property / cites work: Typical subgraphs of 3- and 4-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4352948
@@ Property / cites work: Q4352948 / rank @@
+Normal rank
@@ Property / cites work @@
+Mangoes and blueberries
@@ Property / cites work: Mangoes and blueberries / rank @@
+Normal rank
@@ Property / cites work @@
+Fractional colouring and Hadwiger's conjecture
@@ Property / cites work: Fractional colouring and Hadwiger's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+The four-colour theorem
@@ Property / cites work: The four-colour theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Q4273877
@@ Property / cites work: Q4273877 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XIII: The disjoint paths problem
@@ Property / cites work: Graph minors. XIII: The disjoint paths problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XV: Giant steps
@@ Property / cites work: Graph minors. XV: Giant steps / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XVII: Taming a vortex
@@ Property / cites work: Graph minors. XVII: Taming a vortex / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. XVI: Excluding a non-planar graph
@@ Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+Hadwiger's conjecture for \(K_ 6\)-free graphs
@@ Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Quickly excluding a planar graph
@@ Property / cites work: Quickly excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+The extremal function for \(K_{9}\) minors
@@ Property / cites work: The extremal function for \(K_{9}\) minors / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263662
@@ Property / cites work: Q4263662 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved linear edge bound for graph linkages
@@ Property / cites work: An improved linear edge bound for graph linkages / rank @@
+Normal rank
@@ Property / cites work @@
+An extremal function for contractions of graphs
@@ Property / cites work: An extremal function for contractions of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The extremal function for complete minors
@@ Property / cites work: The extremal function for complete minors / rank @@
+Normal rank
@@ Property / cites work @@
+Two Minor Problems
@@ Property / cites work: Two Minor Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Color-critical graphs on a fixed surface
@@ Property / cites work: Color-critical graphs on a fixed surface / rank @@
+Normal rank
@@ Property / cites work @@
+Beweis einer Abschwächung der Hadwiger-Vermutung
@@ Property / cites work: Beweis einer Abschwächung der Hadwiger-Vermutung / rank @@
+Normal rank