Generalized edge-chromatic numbers and additive hereditary properties of graphs | Zendy

Michael Dorfling | Zendy; Samantha Dorfling | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Generalized edge-chromatic numbers and additive hereditary properties of graphs

Author(s) -

Michael Dorfling,

Samantha Dorfling

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

Subject(s) - mathematics , chromatic scale , combinatorics , enhanced data rates for gsm evolution , discrete mathematics , computer science , artificial intelligence

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 hereditary properties of graphs. The generalized edge-chromatic number ρQ(P) is defined as the least integer n such that P ⊆ nQ. We investigate the generalized edge-chromatic numbers of the properties → H, Ik, Ok, W∗ k , 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