Computational complexity of compaction to irreflexive cycles
type: Item
instance of: scholarly article
title: Computational complexity of compaction to irreflexive cycles
zbMATH Open document ID: 1069.68053
DOI: 10.1016/S0022-0000(03)00034-5
author: Narayan Vikas
published in: Journal of Computer and System Sciences
publication date: 2004-08-10T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2085634
MaRDI profile type: Publication
cites work: Absolute retracts of bipartite graphs
cites work: Absolute reflexive retracts and absolute bipartite retracts
cites work: List homomorphisms to reflexive graphs
cites work: List homomorphisms and circular arc graphs
cites work: Parallel concepts in graph theory
cites work: Q4049082
cites work: Q3941434
cites work: On the complexity of H-coloring
cites work: Absolute Retracts and Varieties of Reflexive Graphs
cites work: Fixed-edge theorem for graphs with loops
cites work: Q3994353
cites work: A characterization of absolute retracts of n-chromatic graphs
cites work: Q4252439
cites work: Computational Complexity of Compaction to Reflexive Cycles
Recommended article: Computational Complexity of Compaction to Reflexive Cycles
Recommended article: Q4252439
Recommended article: On the complexity of orthogonal compaction
Recommended article: Q3024762
Recommended article: Q4837701
Recommended article: Q5461510
Recommended article: Computational complexity of fixed points and intersection points
Recommended article: Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon
Recommended article: Computational complexity of fixed points
Recommended article: The complexity of some complementation problems
description: scientific article; zbMATH DE number 2085634