A characterization of absolute retracts of n-chromatic graphs
From MaRDI portal
Publication:1076682
DOI10.1016/0012-365X(85)90159-1zbMath0594.05033MaRDI QIDQ1076682
Publication date: 1985
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Absolute retracts of split graphs, Hereditary modular graphs, Computational complexity of compaction to irreflexive cycles, Dismantling absolute retracts of reflexive graphs, Beyond Helly graphs: the diameter problem on absolute retracts, Efficient characterizations of \(n\)-chromatic absolute retracts, On retracts, absolute retracts, and foldings in cographs, Graphs with edge-preserving majority functions, Products of absolute retracts, On the extension of vertex maps to graph homomorphisms, Computational complexity relationship between compaction, vertex-compaction, and retraction, Absolute retracts of bipartite graphs, Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon, A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
Cites Work
