Pages that link to "Item:Q456142"
From MaRDI portal
The following pages link to Partitioning extended \(P_4\)-laden graphs into cliques and stable sets (Q456142):
Displaying 5 items.
- PSPACE-hardness of two graph coloring games (Q2132363) (← links)
- Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960) (← links)
- PSPACE-completeness of two graph coloring games (Q2182325) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- Fixed-parameter algorithms for the cocoloring problem (Q2440099) (← links)
