On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
From MaRDI portal
(Redirected from Publication:858685)
Recommendations
- Connectivities for k-knitted graphs and for minimal counterexamples to Hadwiger's conjecture
- Minimal counterexamples to a conjecture of Hall and Paige
- On minimally \(k\)-connected matroids
- A general minimax theorem based on connectedness
- On minor-minimally-connected matroids
- Highly connected counterexamples to a conjecture on α -domination
- A counterexample to a conjecture on the connectivity of \(0\)-\(1\) polytope graphs
- On minimally \((n,\lambda)\)-connected graphs
- Connected matchings and Hadwiger's conjecture
- On a counter-example to the Hirsch conjecture
Cites work
- scientific article; zbMATH DE number 4134069 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- An improved linear edge bound for graph linkages
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
- Graphs with forbidden subgraphs
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Highly linked graphs
- Linear connectivity forces large complete bipartite minors
- Non-zero disjoint cycles in highly connected group labelled graphs
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- On separating sets of edges in contraction-critical graphs
- On the structure of 5- and 6-chromatic abstract graphs.
- The four-colour theorem
- Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem.
- Vertex-disjoint cycles containing specified edges
- Über trennende Eckenmengen in homomorphiekritischen Graphen
Cited in
(20)- Disproof of the group coloring version of the Hadwiger conjecture
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
- A short proof of a theorem of dirac's about hadwiger's conjecture
- Minimum degree condition for a graph to be knitted
- Refined List Version of Hadwiger’s Conjecture
- Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
- Subgraphs of large connectivity and chromatic number
- Connectivities for \(k\)-knitted graphs and for minimal counterexamples to Hadwiger's conjecture
- An improved linear connectivity bound for tournaments to be highly linked
- Some recent progress and applications in graph minor theory
- Linear connectivity forces large complete bipartite minors
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor
- -MINIMUM SPANNING LENGTHS AND AN EXTENSION TO BURNSIDE’S THEOREM ON IRREDUCIBILITY
- Recent progress towards Hadwiger's conjecture
- Asymptotic equivalence of Hadwiger's conjecture and its odd minor-variant
- Coloring graphs with forbidden minors
- scientific article; zbMATH DE number 475585 (Why is no real title available?)
- Connectivity and choosability of graphs with no \(K_t\) minor
- Hadwiger's conjecture
- Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture
This page was built for publication: On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858685)
