FindPlanarColoring
finds a coloring with minimal size for the faces of the planar graph g.
FindPlanarColoring[g,{c1,c2,…}]
finds a coloring {c1,c2,…,ck} for the faces in the graph g.
Details and Options
- FindPlanarColoring is also known as graph coloring and face coloring.
- FindPlanarColoring is typically used for modeling scheduling and assignment problems.
- FindPlanarColoring[g] finds a coloring {c1,c2,…,ck} with minimal size for the faces of g where ci are integers and ci is not equal to cj for two adjacent faces fi and fj of g with indices i and j.
- FindPlanarColoring[g,{c1,c2,…}] uses the specified colors ci.
- FindPlanarColoring[g,l] is effectively equivalent to FindPlanarColoring[g,{1,2,…,l}].
Examples
open allclose allBasic Examples (2)
Scope (6)
FindPlanarColoring works with undirected graphs:
Properties & Relations (3)
Use PlanarFaceList to get the faces of planar graphs:
Use DualPlanarGraph to get the dual of planar graphs:
A face coloring of a planar graph is a vertex coloring of its dual:
Text
Wolfram Research (2021), FindPlanarColoring, Wolfram Language function, https://reference.wolfram.com/language/ref/FindPlanarColoring.html.
CMS
Wolfram Language. 2021. "FindPlanarColoring." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/FindPlanarColoring.html.
APA
Wolfram Language. (2021). FindPlanarColoring. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/FindPlanarColoring.html