Pages that link to "Item:Q1826951"

The following pages link to Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951):

Displayed 37 items.

• On graph thickness, geometric thickness, and separator theorems (Q621923) ‎ (← links)
• Characterisations and examples of graph classes with bounded expansion (Q661943) ‎ (← links)
• Some recent progress and applications in graph minor theory (Q878052) ‎ (← links)
• Sublinear separators, fragility and subexponential expansion (Q896068) ‎ (← links)
• On low tree-depth decompositions (Q897253) ‎ (← links)
• Colouring games on outerplanar graphs and trees (Q1025941) ‎ (← links)
• Colouring graphs with bounded generalized colouring number (Q1045038) ‎ (← links)
• Partitioning into graphs with only small components (Q1405114) ‎ (← links)
• On generalized choice and coloring numbers (Q1733934) ‎ (← links)
• Surfaces, tree-width, clique-minors, and partitions (Q1850479) ‎ (← links)
• Approximation algorithms via contraction decomposition (Q1945289) ‎ (← links)
• Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) ‎ (← links)
• Additive non-approximability of chromatic number in proper minor-closed classes (Q2099409) ‎ (← links)
• On fractional fragility rates of graph classes (Q2205120) ‎ (← links)
• The \(k\)-strong induced arboricity of a graph (Q2408964) ‎ (← links)
• Grad and classes with bounded expansion. I: Decompositions (Q2426456) ‎ (← links)
• Grad and classes with bounded expansion. II: Algorithmic aspects (Q2426457) ‎ (← links)
• Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities (Q2427548) ‎ (← links)
• Tree-depth, subgraph coloring and homomorphism bounds (Q2493118) ‎ (← links)
• A global decomposition theorem for excluding immersions in graphs with no edge-cut of order three (Q2668021) ‎ (← links)
• Hadwiger’s Conjecture (Q2827298) ‎ (← links)
• Counting Homomorphisms to Sparse Graphs (Q2851494) ‎ (← links)
• Bounds on vertex colorings with restrictions on the union of color classes (Q3083409) ‎ (← links)
• The Grad of a Graph and Classes with Bounded Expansion (Q3439315) ‎ (← links)
• Fraternal Augmentations of graphs, Coloration and Minors (Q3439588) ‎ (← links)
• Game coloring the Cartesian product of graphs (Q3605153) ‎ (← links)
• Orthogonal Tree Decompositions of Graphs (Q4634649) ‎ (← links)
• Vertex-Bipartition Method for Colouring Minor-Closed Classes of Graphs (Q4933601) ‎ (← links)
• Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) ‎ (← links)
• Additive non-approximability of chromatic number in proper minor-closed classes (Q5002722) ‎ (← links)
• On Universal Graphs of Minor Closed Families (Q5300987) ‎ (← links)
• (Q5743487) ‎ (← links)
• Partitioning \(H\)-minor free graphs into three subgraphs with no large components (Q5915769) ‎ (← links)
• On low rank-width colorings (Q5918207) ‎ (← links)
• PTAS for Sparse General-valued CSPs (Q6075749) ‎ (← links)
• A \(p\)-centered coloring for the grid using \(O(p)\) colors (Q6080129) ‎ (← links)
• On weighted sublinear separators (Q6081561) ‎ (← links)