A retraction problem in graph theory

DOI10.1016/0012-365X(85)90062-7zbMath0588.05043MaRDI QIDQ1073052

Alain Quilliot

Publication date: 1985

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

zbMATH Keywords

homomorphismplanar graphchordless cycleGraph retractions

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99)

Related Items (6)

Colouring, constraint satisfaction, and complexity ⋮ An extension of a fixed point problem for simple graphs ⋮ Multiple Routing Strategies in a Labelled Network ⋮ On the extension of vertex maps to graph homomorphisms ⋮ Retracting Graphs to Cycles ⋮ More on linear and metric tree maps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Helly property working as a compactness criterion on graphs
• Graph derivatives
• Absolute planar retracts and the four colour conjecture
• Fixed-edge theorem for graphs with loops

This page was built for publication: A retraction problem in graph theory