File:Colored split graph.svg
| Uploaded by | David Eppstein |
|---|---|
| Upload date | 2024-03-26T01:09:31Z |
| MIME type | image/svg+xml |
| Dimensions | 432 × 432 px |
| File size | 1.3 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:
 
|
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.
|