Unique-maximum coloring of plane graphs | Zendy

Igor Fabrici | Zendy; Frank Göring | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Unique-maximum coloring of plane graphs

Author(s) -

Igor Fabrici,

Frank Göring

Publication year - 2015

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1846

Subject(s) - mathematics , combinatorics , complete coloring , edge coloring , list coloring , brooks' theorem , fractional coloring , graph coloring , plane (geometry) , greedy coloring , chordal graph , discrete mathematics , 1 planar graph , graph , geometry , line graph , graph power

A unique-maximum k-coloring with respect to faces of a plane graph G is a coloring with colors 1, . . . , k so that, for each face of G, the maximum color occurs exactly once on the vertices of α. We prove that any plane graph is unique-maximum 3-colorable and has a proper unique-maximum coloring with 6 colors

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research