Non 3-choosable bipartite graphs and the Fano plane

Description

Citation

Title Non 3-choosable bipartite graphs and the Fano plane
Author(s) Shannon L. Fitzpatrick, G. MacGillivray
Journal Ars Combinatoria
Date 2005
Volume 76
Issue
Start page 113
End page 127
Abstract It is known that the smallest complete bipartite graph which is not 3-choosable has 14 vertices. We show that the extremal configuration is unique.

Using APA 6th Edition citation style.

[Page generation failure. The bibliography processor requires a browser with Javascript enabled.]

Times viewed: 163

Adding this citation to "My List" will allow you to export this citation in other styles.