The complexity of \((P_k, P_\ell ) \)-arrowing

DOI10.1007/978-3-031-43587-4_18MaRDI QIDQ6546595

Stanisław Radziszowski, Zohair Raza Hassan, Edith Hemaspaandra

Publication date: 29 May 2024

zbMATH Keywords

complexityRamsey theorygraph arrowing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Critical graphs for \(R(P_n,P_m)\) and the star-critical Ramsey number for paths
• On the use of senders in generalized Ramsey theory for graphs
• On the complexity of H-coloring
• The directed subgraph homeomorphism problem
• The complexity of \(G\)-free colourability
• Ramsey theory applications
• The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
• Graph Ramsey theory and the polynomial hierarchy
• Complexity of the cluster vertex deletion problem on \(H\)-free graphs

This page was built for publication: The complexity of \((P_k, P_\ell ) \)-arrowing