On improper interval edge colourings | Zendy

Peter Hudák | Zendy; František Kardoš | Zendy; Tomáš Madaras | Zendy; Michaela Vrbjarová | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On improper interval edge colourings

Author(s) -

Peter Hudák,

František Kardoš,

Tomáš Madaras,

Michaela Vrbjarová

Publication year - 2016

Publication title -

czechoslovak mathematical journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.302

H-Index - 31

eISSN - 1572-9141

pISSN - 0011-4642

DOI - 10.1007/s10587-016-0313-7

Subject(s) - chromatic scale , interval (graph theory) , combinatorics , vertex (graph theory) , mathematics , enhanced data rates for gsm evolution , invariant (physics) , graph , integer (computer science) , upper and lower bounds , discrete mathematics , computer science , artificial intelligence , mathematical analysis , mathematical physics , programming language

International audienceWe study improper interval edge colourings, defined by the requirement that the edge colours around each vertex form an integer interval. For the corresponding chromatic invariant (being the maximum number of colours in such a colouring), we present upper and lower bounds and discuss their qualities; also, we determine its values and estimates for graphs of various families, like wheels, prisms or complete graphs. The study of this parameter was inspired by the interval colouring, introduced by Asratian, Kamalian (1987). The difference is that we relax the requirement on the original colouring to be proper

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