Jump to content

File:List-coloring-K-3-27.svg

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Original file (SVG file, nominally 778 × 780 pixels, file size: 17 KB)

Summary

Description
English: An instance of the list coloring problem, on the complete bipartite graph K3,27, with three colors per vertex. No matter which colors are chosen for the three central vertices, one of the 27 outer vertices will have all of its three colors used by its three neighbors, preventing it from being colored. Therefore, the list chromatic number of K3,27 is at least four.
Date
Source Own work
Author David Eppstein

Licensing

I, the copyright holder of this work, hereby publish it under the following license:
Creative Commons CC-Zero This file is made available under the Creative Commons CC0 1.0 Universal Public Domain Dedication.
The person who associated a work with this deed has dedicated the work to the public domain by waiving all of their rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law. You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

21 February 2012

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current22:14, 21 February 2012Thumbnail for version as of 22:14, 21 February 2012778 × 780 (17 KB)David Eppstein{{Information |Description ={{en|1=An instance of the list coloring problem, on the complete bipartite graph ''K''<sub>3,27</sub>, with three colors per vertex. No matter which colors are chosen fo

The following page uses this file:

Global file usage

The following other wikis use this file: