Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring.
Henry A. KiersteadAlexandr V. KostochkaPublished in: J. Graph Theory (2012)
Keyphrases
- random graphs
- graph representation
- directed graph
- graph theory
- graph structure
- graph model
- graph based algorithm
- graph theoretic
- weighted graph
- directed acyclic graph
- data sets
- maximum number
- structured data
- mobile robot
- labeled graphs
- stable set
- clustering coefficient
- dependency graph
- graph data
- search algorithm
- neural network