Pages that link to "Item:Q2322884"
From MaRDI portal
The following pages link to \(H\)-colouring \(P_t\)-free graphs in subexponential time (Q2322884):
Displayed 16 items.
- Connected greedy coloring of \(H\)-free graphs (Q777440) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- Colouring \((P_r + P_s)\)-free graphs (Q2182090) (← links)
- List 3-coloring graphs with no induced \(P_6 + rP_3\) (Q2223697) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- Subexponential algorithms for variants of the homomorphism problem in string graphs (Q2301363) (← links)
- (Q5075768) (← links)
- Colouring (P_r+P_s)-Free Graphs (Q5090995) (← links)
- Colouring H-free graphs of bounded diameter. (Q5092372) (← links)
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508) (← links)
- On the Maximum Weight Independent Set Problem in Graphs without Induced Cycles of Length at Least Five (Q5854894) (← links)
- (Q5874504) (← links)
- Approximately coloring graphs without long induced paths (Q5915792) (← links)
- On cycle transversals and their connected variants in the absence of a small linear forest (Q5918178) (← links)
- Complexity of \(C_k\)-coloring in hereditary classes of graphs (Q6040658) (← links)
- (Q6065467) (← links)