File:Colored split graph.svg

Original file (SVG file, nominally 432 × 432 pixels, file size: 1 KB)

Summary

Description
English: Optimal coloring of a split graph, a graph that can be partitioned into a maximal clique (heavy vertices and edges) and an independent set (light vertices). The coloring is obtained by giving a separate color to each vertex in the clique, and then giving each vertex in the independent set the same color as a clique vertex that it is not adjacent to.
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

Optimal coloring of a split graph

Items portrayed in this file

depicts

25 March 2024

image/svg+xml

5160eaca8f32a60a2ab429b5b41e206cb9e70724

1,324 byte

432 pixel

432 pixel

File history

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

Date/TimeThumbnailDimensionsUserComment
current01:09, 26 March 2024Thumbnail for version as of 01:09, 26 March 2024432 × 432 (1 KB)David EppsteinUploaded own work with UploadWizard

The following page uses this file:

Metadata