Tag: Total Coloring Conjecture

Graph theory has uncovered many secrets of networks and relationships, but some problems remain unsolved. Here are three famous unsolved problems in graph theory, the Total Coloring Conjecture, the Hadwiger Conjecture, and the 1-Factorization Conjecture, and why they continue to puzzle mathematicians. Building Blocks of Graph Theory 1-Factorization Conjecture Unfriendly Partition read more