The following pages link to Petr A. Golovach (Q259036):
Displaying 11 items.
- 4-coloring \(H\)-free graphs when \(H\) is small (Q1759872) (← links)
- Systems of pairs of \(q\)-distant representatives, and graph colorings (Q2577585) (← links)
- k-Gap Interval Graphs (Q2894479) (← links)
- Cops and Robber with Constraints (Q2910936) (← links)
- Contraction Bidimensionality: The Accurate Picture (Q3639283) (← links)
- Editing to Connected F-Degree Graph (Q5232130) (← links)
- Long Circuits and Large Euler Subgraphs (Q5891185) (← links)
- Detours in directed graphs (Q6490976) (← links)
- Parameterized Complexity of Broadcasting in Graphs (Q6496553) (← links)
- Turán’s Theorem Through Algorithmic Lens (Q6496554) (← links)
- Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes (Q6508134) (← links)
