Products of absolute retracts

DOI10.1016/0012-365X(88)90016-7zbMath0667.05021OpenAlexW2007831585MaRDI QIDQ5903896

Erwin Pesch

Publication date: 1988

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90016-7

zbMATH Keywords

productabsolute retractn-chromatic graphreflective graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items

Competitive location on a network, Absolute retracts of split graphs, Homomorphically full graphs, A Helly theorem in weakly modular space, List homomorphisms to reflexive graphs, Beyond Helly graphs: the diameter problem on absolute retracts, Colouring, constraint satisfaction, and complexity, Efficient characterizations of \(n\)-chromatic absolute retracts, Graphs with edge-preserving majority functions, Absolute reflexive retracts and absolute bipartite retracts, Retracts of strong products of graphs, An extension of a fixed point problem for simple graphs, Absolute retracts and varieties generated by chordal graphs, On the extension of vertex maps to graph homomorphisms, Computational complexity relationship between compaction, vertex-compaction, and retraction, Injective envelope of graphs and transition systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of absolute retracts of n-chromatic graphs
• Holes in ordered sets
• Dismantling absolute retracts of reflexive graphs
• Absolute retracts of bipartite graphs
• Vertex-to-vertex pursuit in a graph
• The smallest graph variety containing all paths
• Absolute planar retracts and the four colour conjecture
• Minimal extensions of graphs to absolute retracts
• Fixed-edge theorem for graphs with loops