Pages that link to "Item:Q2301363"

The following pages link to Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363):

Displayed 10 items.

• Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) ‎ (← links)
• List covering of regular multigraphs (Q2169958) ‎ (← links)
• Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) ‎ (← links)
• Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) ‎ (← links)
• (Q5874504) ‎ (← links)
• (Q5874546) ‎ (← links)
• On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) ‎ (← links)
• An algorithmic framework for locally constrained homomorphisms (Q6039418) ‎ (← links)
• Computing list homomorphisms in geometric intersection graphs (Q6039432) ‎ (← links)
• (Q6065467) ‎ (← links)