论文信息 - 3-Colorability and forbidden subgraphs. I: Characterizing pairs

3-Colorability and forbidden subgraphs. I: Characterizing pairs

In this paper we investigate chromatic aspects for graphs with forbidden induced subgraphs with emphasis on the question of 3-colorability. In the main part all possible pairs (A,B) of forbidden induced subgraphs, s.t. every A- and B-free graph is 3-colorable, are determined. Moreover, this is embedded in a more general problem and the main result extends Vizing's classical edge coloring result.

Bert Randerath | B. Randerath

[1] D. West. Introduction to Graph Theory , 1995 .

[2] Jan Mycielski. Sur le coloriage des graphs , 1955 .

[3] D. Seinsche. On a property of the class of n-colorable graphs , 1974 .

[4] R. L. Brooks. On Colouring the Nodes of a Network , 1941 .

[5] Hal A. Kierstead,et al. On the chromatic index of multigraphs without large triangles , 1984, J. Comb. Theory, Ser. B.

[6] N. Biggs. Algebraic Graph Theory: The multiplicative expansion , 1974 .

[7] Ingo Schiermeyer,et al. Three-colourability and forbidden subgraphs. II: polynomial algorithms , 2002, Discret. Math..

[8] Myriam Preissmann,et al. On the NP-completeness of the k-colorability problem for triangle-free graphs , 1996, Discret. Math..

[9] P. Erdös,et al. Graph Theory and Probability , 1959 .

[10] Bert Randerath. 3-Colourability and Forbidden Subgraphs , 2000, Electron. Notes Discret. Math..

[11] Stephan Olariu,et al. Paw-Fee Graphs , 1988, Inf. Process. Lett..

[12] R. Greenwood,et al. Combinatorial Relations and Chromatic Graphs , 1955, Canadian Journal of Mathematics.

[13] Ingo Schiermeyer,et al. Vertex Colouring and Forbidden Subgraphs – A Survey , 2004, Graphs Comb..

[14] Ingo Schiermeyer,et al. A note on Brooks' theorem for triangle-free graphs , 2002, Australas. J Comb..