Generalized chromatic numbers and additive hereditary properties of graphs | Zendy

Izak Broere | Zendy; Samantha Dorfling | Zendy; Elizabeth Jonck | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Generalized chromatic numbers and additive hereditary properties of graphs

Author(s) -

Izak Broere,

Samantha Dorfling,

Elizabeth Jonck

Publication year - 2002

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

Subject(s) - mathematics , chromatic scale , combinatorics , brooks' theorem , enhanced data rates for gsm evolution , edge coloring , discrete mathematics , chordal graph , graph , 1 planar graph , line graph , computer science , telecommunications , graph power

An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. Let P and Q be additive hereditary properties of graphs. The generalized chromatic number χQ(P) is defined as follows: χQ(P) = n iff P ⊆ Qn but P 6⊆ Qn−1. We investigate the generalized chromatic numbers of the well-known properties of graphs Ik, Ok, Wk, Sk and Dk.

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