Forbidden Structures for Planar Perfect Consecutively Colourable Graphs

• Autorzy: Marta Borowiecka-Olszewska , Ewa Drgas-Burchardt
• Języki publikacji: EN

Abstrakty

EN

A consecutive colouring of a graph is a proper edge colouring with posi- tive integers in which the colours of edges incident with each vertex form an interval of integers. The idea of this colouring was introduced in 1987 by Asratian and Kamalian under the name of interval colouring. Sevast- janov showed that the corresponding decision problem is NP-complete even restricted to the class of bipartite graphs. We focus our attention on the class of consecutively colourable graphs whose all induced subgraphs are consecutively colourable, too. We call elements of this class perfect consecutively colourable to emphasise the conceptual similarity to perfect graphs. Obviously, the class of perfect consecutively colourable graphs is induced hereditary, so it can be characterized by the family of induced forbidden graphs. In this work we give a necessary and sufficient conditions that must be satisfied by the generalized Sevastjanov rosette to be an induced forbid- den graph for the class of perfect consecutively colourable graphs. Along the way, we show the exact values of the deficiency of all generalized Sevastjanov rosettes, which improves the earlier known estimating result. It should be mentioned that the deficiency of a graph measures its closeness to the class of consecutively colourable graphs. We motivate the investigation of graphs considered here by showing their connection to the class of planar perfect consecutively colourable graphs.

Słowa kluczowe

EN

edge colouring; consecutive (interval) colouring; deficiency; Sevastjanov graph; forbidden graph

• Wydawca: De Gruyter Open
• Czasopismo: Discussiones Mathematicae Graph Theory
• Rocznik: 2017
• Tom: 37
• Numer: 2
• Strony: 315-336

Daty

wydano

2017-05-01

otrzymano

2016-04-19

poprawiono

2016-10-01

zaakceptowano

2016-10-01

online

2017-04-01

Twórcy

autor

Marta Borowiecka-Olszewska

• Faculty of Mathematics, Computer Science and Econometrics University of Zielona Góra Z. Szafrana 4a, 65–516 Zielona Góra,

autor

Ewa Drgas-Burchardt

• Faculty of Mathematics, Computer Science and Econometrics University of Zielona Góra Z. Szafrana 4a, 65-516 Zielona Góra,

Identyfikatory

DOI

10.7151/dmgt.1958