Fractional Q-coloring of graphs | Zendy

Július Czap | Zendy; Peter Mihók | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Fractional Q-coloring of graphs

Author(s) -

Július Czap,

Peter Mihók

Publication year - 2013

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

Subject(s) - combinatorics , mathematics , edge coloring , isomorphism (crystallography) , chromatic scale , chordal graph , graph coloring , brooks' theorem , discrete mathematics , property (philosophy) , simple (philosophy) , indifference graph , simple graph , induced subgraph isomorphism problem , graph , 1 planar graph , line graph , graph power , voltage graph , philosophy , chemistry , epistemology , crystal structure , crystallography

An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphism. Let be an additive hereditary property of graphs. A -edge-coloring of a simple graph is an edge coloring in which the edges colored with the same color induce a subgraph of property . In this paper we present some results on fractional -edge-colorings. We determine the fractional -edge chromatic number for matroidal properties of graphs.

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