Some recent progress and applications in graph minor theory
From MaRDI portal
(Redirected from Publication:878052)
Recommendations
Cites work
- scientific article; zbMATH DE number 3865318 (Why is no real title available?)
- scientific article; zbMATH DE number 16300 (Why is no real title available?)
- scientific article; zbMATH DE number 48089 (Why is no real title available?)
- scientific article; zbMATH DE number 1342090 (Why is no real title available?)
- scientific article; zbMATH DE number 475583 (Why is no real title available?)
- scientific article; zbMATH DE number 475598 (Why is no real title available?)
- scientific article; zbMATH DE number 475621 (Why is no real title available?)
- scientific article; zbMATH DE number 1057879 (Why is no real title available?)
- scientific article; zbMATH DE number 1156585 (Why is no real title available?)
- scientific article; zbMATH DE number 863474 (Why is no real title available?)
- scientific article; zbMATH DE number 969111 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 5057511 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- scientific article; zbMATH DE number 3102312 (Why is no real title available?)
- 103 graphs that are irreducible for the projective plane
- 2-linked graphs
- A Borsuk theorem for antipodal links and a spectral characterization of linklessly embeddable graphs
- A Kuratowski theorem for nonorientable surfaces
- A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A Polynomial Solution to the Undirected Two Paths Problem
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- A Separator Theorem for Nonplanar Graphs
- A characterization of graphs with no cube minor
- A counter-example to ‘Wagner's conjecture’ for infinite graphs
- A kuratowski theorem for the projective plane
- A newly recognized intrinsically knotted graph
- A relaxed Hadwiger's conjecture for list colorings
- A simpler proof of the excluded minor theorem for higher surfaces
- Acyclic colorings of planar graphs
- An \(\tilde{O}(n^{3/14})\)-coloring algorithm for 3-colorable graphs
- An excluded minor theorem for the Octahedron plus an edge
- An excluded minor theorem for the octahedron
- An extremal function for contractions of graphs
- An improved linear edge bound for graph linkages
- Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
- Applications of a Planar Separator Theorem
- Approximating the list-chromatic number and the chromatic number in minor-closed and odd-minor-closed classes of graphs
- Approximation algorithms for NP-complete problems on planar graphs
- Approximation algorithms via contraction decomposition
- Beweis einer Abschwächung der Hadwiger-Vermutung
- Branch-width and Rota's conjecture
- Branch-width and well-quasi-ordering in matroids and graphs.
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Cliques in dense GF(\(q\))-representable matroids
- Color-critical graphs on a fixed surface
- Coloring locally bipartite graphs on surfaces.
- Coloring-flow duality of embedded graphs
- Combinatorial Local Planarity and the Width of Graph Embeddings
- Complete minors in \(K_{s,s}\)-free graphs
- Computing Vertex Connectivity: New Bounds from Old Techniques
- Contractions to k8
- Dense minors in graphs of large girth
- Diameter and treewidth in minor-closed graph families
- Directed tree-width
- Disjoint \(K_{r}\)-minors in large graphs with given average degree
- Disjoint cocircuits in matroids with large rank
- Disjoint paths in graphs
- Efficient algorithms for acyclic colorings of graphs
- Efficient algorithms for vertex arboricity of planar graphs
- Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen
- Elimination of local bridges
- Every planar graph is 5-choosable
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Excluding Subdivisions of Infinite Cliques
- Excluding a countable clique
- Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Excluding infinite clique minors
- Excluding infinite minors
- Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte
- Forcing unbalanced complete bipartite minors
- Fractional colouring and Hadwiger's conjecture
- Generating internally four-connected graphs
- Girth in graphs
- Graph Drawing
- Graph colorings with local constraints -- a survey
- Graph minors XXIII. Nash-Williams' immersion conjecture
- Graph minors and graphs on surfaces
- Graph minors and linkages
- Graph minors. I. Excluding a forest
- Graph minors. II. Algorithmic aspects of tree-width
- Graph minors. III. Planar tree-width
- Graph minors. IV: Tree-width and well-quasi-ordering
- Graph minors. IX: Disjoint crossed paths
- Graph minors. V. Excluding a planar graph
- Graph minors. VI. Disjoint paths across a disc
- Graph minors. VII: Disjoint paths on a surface
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XI: Circuits on a surface
- Graph minors. XII: Distance on a surface
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XIV: Extending an embedding
- Graph minors. XIX: Well-quasi-ordering on a surface.
- Graph minors. XV: Giant steps
- Graph minors. XVI: Excluding a non-planar graph
- Graph minors. XVII: Taming a vortex
- Graph minors. XVIII: Tree-decompositions and well-quasi-ordering
- Graph minors. XX: Wagner's conjecture
- Graph minors. XXI. graphs with unique linkages
- Graph minors. XXII. Irrelevant vertices in linkage problems
- Graphs on surfaces
- Graphs with forbidden subgraphs
- Grids and their minors
- Hadwiger's conjecture for \(K_ 6\)-free graphs
- Highly connected sets and the excluded grid theorem
- Highly linked graphs
- Homomorphiesätze für Graphen
- K-linked graphs with girth condition
- Knots and links in spatial graphs
- Kuratowski chains
- Linear connectivity forces large complete bipartite minors
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- List colourings of planar graphs
- Lower bound of the Hadwiger number of graphs by their average degree
- Mangoes and blueberries
- Minors in graphs of large girth
- Multiple-source shortest paths in planar graphs
- Multiplicities of eigenvalues and tree-width of graphs
- Note on the irreducible triangulations of the Klein bottle
- Obstructions to branch-decomposition of matroids
- On Independent Circuits Contained in a Graph
- On Rota's conjecture and excluded minors containing large projective geometries.
- On Sufficient Degree Conditions for a Graph to be k-linked
- On \(K_{s,t}\)-minors in graphs with given average degree. II
- On the Computational Complexity of Combinatorial Problems
- On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
- On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture
- On the excluded minors for the matroids of branch-width \(k\)
- On the null space of a Colin de Verdière matrix
- On the presence of disjoint subgraphs of a specified type
- On the structure of 5- and 6-chromatic abstract graphs.
- On the structure of \(k\)-connected graphs without \(K_{k}\)-minor
- Parallel complexity of partitioning a planar graph into vertex-induced forests
- Petersen family minors
- Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
- Quickly excluding a planar graph
- S-functions for graphs
- Sachs' linkless embedding conjecture
- Separating and nonseparating disjoint homotopic cycles in graph embeddings
- Separating cycles in doubly toroidal embeddings
- Subexponential parameterized algorithms on graphs of bounded-genus and \(H\)-minor-free graphs
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- Surfaces, tree-width, clique-minors, and partitions
- Tangles, tree-decompositions and grids in matroids
- The Point-Arboricity of Planar Graphs
- The complexity of planar graph choosability
- The depth-first search tree structure of \(TK_{\aleph_ 0}\)-free graphs
- The directed subgraph homeomorphism problem
- The extremal function for 3-linked graphs
- The extremal function for \(K_{9}\) minors
- The extremal function for complete minors
- The extremal function for noncomplete minors
- The extremal function for unbalanced bipartite minors
- The four-colour theorem
- Topological cliques in graphs II
- Topological minors in graphs of large girth
- Topological subgraphs in graphs of large girth
- Trennende Knotenpunktmengen und Reduzibilität abstrakter Graphen mit Anwendung auf das Vierfarbenproblem.
- Two Minor Problems
- Typical subgraphs of 3- and 4-connected graphs
- Uniqueness and minimality of large face-width embeddings of graphs
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
- Zero knowledge and the chromatic number
- \(K_{a,k}\) minors in graphs of bounded tree-width
Cited in
(30)- The great theorem of modern combinatorics
- Connectivity and choosability of graphs with no \(K_t\) minor
- scientific article; zbMATH DE number 795221 (Why is no real title available?)
- Improved bound for Hadwiger's conjecture
- Graph minors. XX: Wagner's conjecture
- Neighborhood contraction in graphs
- Local Hadwiger's conjecture
- Breaking the degeneracy barrier for coloring graphs with no K_t minor
- Refined list version of Hadwiger's conjecture (extended abstract)
- Complete graph minors and the graph minor structure theorem
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
- Forbidden minors: finding the finite few
- Graph minors. XIX: Well-quasi-ordering on a surface.
- Reducing linear Hadwiger's conjecture to coloring small graphs
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus
- On the excluded minor structure theorem for graphs of large tree-width
- Minimal universal and dense minor closed classes
- Recent progress on well-quasi-ordering graphs
- scientific article; zbMATH DE number 3906520 (Why is no real title available?)
- Parameters tied to treewidth
- Upper bounds on the graph minor theorem
- New tools and results in graph minor structure theory
- Recent progress towards Hadwiger's conjecture
- The \(\mathbb{Z}_2\)-genus of Kuratowski minors
- Excluding Kuratowski graphs and their duals from binary matroids
- Structure theorem and isomorphism test for graphs with excluded topological subgraphs
- On the pathwidth of hyperbolic 3-manifolds
- Refined List Version of Hadwiger’s Conjecture
- Graph minors. IV: Tree-width and well-quasi-ordering
- The Graph Minor Theorem Meets Algebra
This page was built for publication: Some recent progress and applications in graph minor theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878052)
