Pages that link to "Item:Q2509761"
From MaRDI portal
The following pages link to Graph partitions with prescribed patterns (Q2509761):
Displaying 23 items.
- Colourings, homomorphisms, and partitions of transitive digraphs (Q338575) (← links)
- An algebraic hardness criterion for surjective constraint satisfaction. (Q485113) (← links)
- The complexity of list edge-partitions for simple graphs (Q730267) (← links)
- List matrix partitions of graphs representing geometric configurations (Q1741515) (← links)
- The monotonicity property of \(M\)-partition problems (Q1746577) (← links)
- Minimal obstructions for a matrix partition problem in chordal graphs (Q2097166) (← links)
- Minimal obstructions to \(( s , 1 )\)-polarity in cographs (Q2184672) (← links)
- Complexity of correspondence \(H\)-colourings (Q2184689) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Characterization of color patterns by dynamic \(H\)-paths (Q2322868) (← links)
- Point determining digraphs, \(\{ 0,1 \}\)-matrix partitions, and dualities in full homomorphisms (Q2346339) (← links)
- Minimal obstructions to 2-polar cographs (Q2414467) (← links)
- Join colourings of chordal graphs (Q2515589) (← links)
- Matrix partitions of split graphs (Q2636832) (← links)
- Graph partitions: recent progresses and some open problems (Q2823421) (← links)
- Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes (Q3449838) (← links)
- (Q3839008) (← links)
- (Q5009627) (← links)
- Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
- Almost All Friendly Matrices Have Many Obstructions (Q5251620) (← links)
- Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)
- Full-homomorphisms to paths and cycles (Q6177408) (← links)
- Generalisations of matrix partitions: complexity and obstructions (Q6564025) (← links)
