Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon
graph partitioncomputational complexitycolouringgraph algorithmshomomorphismretractioncompactionvertex-compaction
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
- Computational complexity of compaction to irreflexive cycles
- Computational Complexity of Compaction to Reflexive Cycles
- Algorithms for partition of some class of graphs under compaction and vertex-compaction
- Algorithms for partition of some class of graphs under compaction
- Computing and Combinatorics
- scientific article; zbMATH DE number 3758365 (Why is no real title available?)
- scientific article; zbMATH DE number 40997 (Why is no real title available?)
- scientific article; zbMATH DE number 3463659 (Why is no real title available?)
- scientific article; zbMATH DE number 1953111 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A characterization of absolute retracts of n-chromatic graphs
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
- Absolute Retracts and Varieties of Reflexive Graphs
- Absolute reflexive retracts and absolute bipartite retracts
- Absolute retracts of bipartite graphs
- Algorithms for partition of some class of graphs under compaction
- Algorithms for partition of some class of graphs under compaction and vertex-compaction
- Compaction, Retraction, and Constraint Satisfaction
- Complexity of graph partition problems
- Computational Complexity of Compaction to Reflexive Cycles
- Computational complexity of compaction to irreflexive cycles
- Computing and Combinatorics
- Fixed-edge theorem for graphs with loops
- Graph partitions with prescribed patterns
- List Partitions
- List homomorphisms and circular arc graphs
- List homomorphisms to reflexive graphs
- Monotone monadic SNP and constraint satisfaction
- On the complexity of H-coloring
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Surjective \texttt{H}-colouring over reflexive digraphs
- Coloring problems on bipartite graphs of small diameter
- Algorithms for partition of some class of graphs under compaction
- Computational complexity relationship between compaction, vertex-compaction, and retraction
- Computational Complexity of Compaction to Reflexive Cycles
- Computational complexity of compaction to irreflexive cycles
- Constraint satisfaction problem: what makes the problem easy
This page was built for publication: Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111286)
