Interval incidence coloring of subcubic graphs | Zendy

Anna Małafiejska | Zendy; Michał Małafiejski | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Interval incidence coloring of subcubic graphs

Author(s) -

Anna Małafiejska,

Michał Małafiejski

Publication year - 2017

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.1962

Subject(s) - mathematics , combinatorics , interval (graph theory) , edge coloring , graph coloring , brooks' theorem , complete coloring , discrete mathematics , chordal graph , graph , 1 planar graph , line graph , graph power

In this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is NP-complete, and they asked if Xii(G) ≤ 2Δ(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with Δ(G) = 3

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