ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Discussiones Mathematicae Graph Theory 29(2) (2009)
Mieczysław Borowiecki, Anna Fiedorowicz and Mariusz Hałuszczak
Faculty of Mathematics, Computer Science and Econometrics
University of Zielona Góra
Z. Szafrana 4a, Zielona Góra, Poland
A class R = P1⊗P2⊗…⊗ Pn is defined as the set of the graphs
having an acyclic (P1, P2,…,Pn)-colouring. If P ⊆ R,
then we say that R is an acyclic reducible bound for P.
In this paper we present acyclic reducible bounds for the class of outerplanar graphs.
Keywords: graph, acyclic colouring, additive hereditary class, outerplanar graph.
2000 Mathematics Subject Classification: 05C75, 05C15, 05C35.
Received 13 December 2007
Revised 4 July 2008
Accepted 23 October 2008