Search Results for ""
501 - 510 of 787 for Map coloringSearch Results
View search results from all Wolfram sites (175456 matches)A snark on 30 vertices with edge chromatic number 4. It is implemented in the Wolfram Language as GraphData["DoubleStarSnark"].
The Golomb graph is a unit-distance graph discovered around 1960-1965 by Golomb (Soifer 2008, p. 19). It is implemented in the Wolfram Language as GraphData["GolombGraph"]. A ...
Heule graphs are a set of unit-distance graphs with chromatic number five derived by Marijn Heule in April 2018 to July 2918 from the 1581-vertex de Grey Graph (Heule 2018). ...
De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...
A Mycielski graph M_k of order k is a triangle-free graph with chromatic number k having the smallest possible number of vertices. For example, triangle-free graphs with ...
The Parts graphs are a set of unit-distance graphs with chromatic number five derived by Jaan Parts in 2019-2020 (Parts 2020a). They provide some of the smallest known ...
The Szekeres snark was the fifth snark discovered, illustrated above. It has 50 vertices and edge chromatic number 4.
De Grey (2018) found the first examples of unit-distance graphs with chromatic number 5, thus demonstrating that the solution to the Hadwiger-Nelson problem (i.e., the ...
A function is a relation that uniquely associates members of one set with members of another set. More formally, a function from A to B is an object f such that every a in A ...
Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...
...