scientific article; zbMATH DE number 3463659
From MaRDI portal
Publication:4049082
Cited in
(29)- On the natural imprint function of a graph
- On median nature and enumerative properties of Fibonacci-like cubes
- An extension of a fixed point problem for simple graphs
- Retract rigid Cartesian products of graphs
- Absolute retracts and varieties generated by chordal graphs
- Pseudo-modular graphs
- Colouring, constraint satisfaction, and complexity
- A homology theory for colored graphs
- The core of a graph
- 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
- The retracts of Hamming graphs
- A characterization of absolute retracts of n-chromatic graphs
- Graph with given achromatic number
- Products of absolute retracts
- Computational complexity relationship between compaction, vertex-compaction, and retraction
- Retracts of strong products of graphs
- The smallest graph variety containing all paths
- A retraction problem in graph theory
- On the extension of vertex maps to graph homomorphisms
- Beyond Helly graphs: the diameter problem on absolute retracts
- Absolute reflexive retracts and absolute bipartite retracts
- Absolute retracts of bipartite graphs
- Retracts of infinite Hamming graphs
- Efficient characterizations of \(n\)-chromatic absolute retracts
- List homomorphisms to reflexive graphs
- Computational complexity of compaction to irreflexive cycles
- On the Helly property working as a compactness criterion on graphs
- Absolute retracts of split graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4049082)
