Edge-colouring of graphs and hereditary graph properties
Samantha Dorfling, Tomáš Vetrík (2016)
Czechoslovak Mathematical Journal
Similarity:
Edge-colourings of graphs have been studied for decades. We study edge-colourings with respect to hereditary graph properties. For a graph , a hereditary graph property and we define to be the minimum number of colours needed to properly colour the edges of , such that any subgraph of induced by edges coloured by (at most) colours is in . We present a necessary and sufficient condition for the existence of . We focus on edge-colourings of graphs with respect to the hereditary...