Contents

Ars Combinatoria

  • Research article

Minimal Forbidden Graphs of Reducible Additive Hereditary Graph Properties

Ewa. Drgas-Burchardt1, Mariusz Haluszczak1, Peter Mihok2,3
1Faculty of Mathematics, Computer Science and Econometrics University of Zielona Géra ul. prof. Z.Szafrana 4a, 65-516 Zielona Géra, Poland
2Mathematical Institute, Slovak Academy of Sciences, Greddkova 6, 040 01 Koiice, Slovakia
3Department of Applied Mathematics and Business Informatics Faculty of Economics, Technical University Koiice, B. Nemcovej 32, 042 00 Kosice, Slovakia
  • Published: 30/04/2010

Abstract

It is known that any reducible additive hereditary graph property has infinitely many minimal forbidden graphs, however the proof of this fact is not constructive. The purpose of this paper is to construct infinite families of minimal forbidden graphs for some classes of reducible properties. The well-known Hajós’ construction is generalized and some of its applications are presented.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Ewa. Drgas-Burchardt, Mariusz Haluszczak, Peter Mihok. Minimal Forbidden Graphs of Reducible Additive Hereditary Graph Properties[J], Ars Combinatoria, Volume 095. 487-497. .