Pages that link to "Item:Q1984513"

The following pages link to Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513):

Displaying 21 items.

• Polynomial bounds for centered colorings on proper minor-closed graph classes (Q1984513) (← links)
• A \(2^{O(k)}n\) algorithm for \(k\)-cycle in minor-closed graph families (Q2006778) (← links)
• Improved bounds for weak coloring numbers (Q2121806) (← links)
• An improved planar graph product structure theorem (Q2152790) (← links)
• On fractional fragility rates of graph classes (Q2205120) (← links)
• Clustering powers of sparse graphs (Q2209886) (← links)
• A fast algorithm for the product structure of planar graphs (Q2663717) (← links)
• Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
• Bounds on half graph orders in powers of sparse graphs (Q2699651) (← links)
• Two lower bounds for $p$-centered colorings (Q3386629) (← links)
• Empirical Evaluation of Approximation Algorithms for Generalized Graph Coloring and Uniform Quasi-wideness (Q4984870) (← links)
• Twin-width II: small classes (Q5051371) (← links)
• (Q5090476) (← links)
• Improved Bounds for Centered Colorings (Q5162872) (← links)
• (Q5236275) (redirect page) (← links)
• Erdös--Hajnal Properties for Powers of Sparse Graphs (Q5857003) (← links)
• A \(p\)-centered coloring for the grid using \(O(p)\) colors (Q6080129) (← links)
• Sparse universal graphs for planarity (Q6085077) (← links)
• Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
• Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)
• Graph product structure for non-minor-closed classes (Q6170788) (← links)