Contents

Ars Combinatoria

  • Research article

Non \(3\)-Choosable Bipartite Graphs and The Fano Plane

Shannon L.Fitzpatrick1, Gary MacGillivray2
1University of Prince Edward Island Charlottetown, Prince Edward Island
2University of Victoria Vietoria, British Columbia, Canada V8W 3P4
  • Published: 31/07/2005

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.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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

Citation
Shannon L.Fitzpatrick, Gary MacGillivray. Non \(3\)-Choosable Bipartite Graphs and The Fano Plane[J], Ars Combinatoria, Volume 076. 113-127. .