Coloring immersion-free graphs (Q326817): Difference between revisions

@@ Property / cites work @@
+Graph Coloring and the Immersion Order
@@ Property / cites work: Graph Coloring and the Immersion Order / 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 @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Topological cliques of random graphs
@@ Property / cites work: Topological cliques of random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs
+Normal rank
@@ Property / cites work @@
+A bound on the chromatic number of a graph
@@ Property / cites work: A bound on the chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial bounds for the grid-minor theorem
@@ Property / cites work: Polynomial bounds for the grid-minor theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Immersion in four-edge-connected graphs
@@ Property / cites work: Immersion in four-edge-connected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
+Normal rank
@@ Property / cites work @@
+Immersing small complete graphs
@@ Property / cites work: Immersing small complete graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A minimum degree condition forcing complete graph immersion
+Normal rank
@@ Property / cites work @@
+Highly connected sets and the excluded grid theorem
+Normal rank
@@ Property / cites work @@
+On the conjecture of Hajos
@@ Property / cites work: On the conjecture of Hajos / rank @@
+Normal rank
@@ Property / cites work @@
+Q3922703
@@ Property / cites work: Q3922703 / rank @@
+Normal rank
@@ Property / cites work @@
+Zero knowledge and the chromatic number
@@ Property / cites work: Zero knowledge and the chromatic number / rank @@
+Normal rank
@@ Property / cites work @@
+Q5837979
@@ Property / cites work: Q5837979 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q5520564
@@ Property / cites work: Q5520564 / rank @@
+Normal rank
@@ Property / cites work @@
+pretty graph colouring problems
@@ Property / cites work: 25 pretty graph colouring problems / rank @@
+Normal rank
@@ Property / cites work @@
+The Erdős-Pósa property for edge-disjoint immersions in 4-edge-connected graphs
+Normal rank
@@ Property / cites work @@
+Q2904769
@@ Property / cites work: Q2904769 / rank @@
+Normal rank
@@ Property / cites work @@
+The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs
+Normal rank
@@ Property / cites work @@
+Edge-disjoint odd cycles in 4-edge-connected graphs
+Normal rank
@@ Property / cites work @@
+The disjoint paths problem in quadratic time
@@ Property / cites work: The disjoint paths problem in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+Topological cliques in graphs II
@@ Property / cites work: Topological cliques in graphs II / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bound of the Hadwiger number of graphs by their average degree
+Normal rank
@@ Property / cites work @@
+Q3829569
@@ Property / cites work: Q3829569 / rank @@
+Normal rank
@@ Property / cites work @@
+Immersions in Highly Edge Connected Graphs
@@ Property / cites work: Immersions in Highly Edge Connected Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH
+Normal rank
@@ Property / cites work @@
+Q4352948
@@ Property / cites work: Q4352948 / 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. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / 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. XX: Wagner's conjecture
@@ Property / cites work: Graph minors. XX: Wagner's conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors XXIII. Nash-Williams' immersion conjecture
+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 @@
+An extremal function for contractions of graphs
@@ Property / cites work: An extremal function for contractions of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on Hajós' conjecture
@@ Property / cites work: Some remarks on Hajós' conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Über eine Eigenschaft der ebenen Komplexe
@@ Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank @@
+Normal rank
@@ Property / cites work @@
+The structure of graphs not admitting a fixed immersion
+Normal rank