First time here? Check out the FAQ!
Prove that the faces of a Hamiltonian plane graph can be 4-colored in a such a way that whenever two faces are incident with the same edge they receive different colors.
Posted: Feb 12
Seen: 43 times
Last updated: Feb 12
Orienting a Planar Graph
Planar graphs and grid minors
Coloring graphs with odd cycles
Basics of Perfect Graphs
Hadwiger’s conjecture and Random graphs
Characterizing outerplanar graphs
Planar Graphs are Pfaffians
Coloring Planar Graphs
Number of edges in a quasi-planar graph
Graceful Tree Conjecture