Guthrie's problem: new equivalences and rapid reductions

DOI10.1016/0304-3975(95)00126-3zbMath0871.68134OpenAlexW2075419444MaRDI QIDQ672855

Artur Czumaj, Alan M. Gibbons

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00126-3

zbMATH Keywords

four-colour problem3-edge colouring of pairs of trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Rotation sequences and edge-colouring of binary tree pairs

Cites Work

• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• A Theorem on Planar Graphs
• Efficient Planarity Testing
• Every planar map is four colorable
• Problems on pairs of trees and the four colour problem of planar graphs
• Dividing a Graph into Triconnected Components
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Guthrie's problem: new equivalences and rapid reductions