Hakutulokset: Hakutulos
yhteensä 8 hakutulosta
Brooks' Theorem
Brooks' Theorem (1941) is one of the most famous and fundamental theorems in graph theory – it is mentioned/treated in all general monographs on graph theory. It has sparked …
Graph Coloring Problems
Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem …
Hex
Hex: The Full Story is for anyone - hobbyist, professional, student, teacher - who enjoys board games, game theory, discrete math, computing, or history. hex was discovered twice, …
Graph Edge Coloring
Features recent advances and new applications in graph edge coloring Reviewing recent advances in the Edge Coloring Problem, Graph Edge Coloring: Vizing's Theorem and Goldberg's …
Brooks' Theorem
Brooks' Theorem (1941) is one of the most famous and fundamental theorems in graph theory - it is mentioned/treated in all general monographs on graph theory. It has sparked …
Graph Coloring Problems
Contains a wealth of information previously scattered in research journals, conference proceedings and technical reports. Identifies more than 200 unsolved problems. Every problem …
Graph Edge Coloring
Features recent advances and new applications in graph edge coloring Reviewing recent advances in the Edge Coloring Problem, Graph Edge Coloring: Vizing's Theorem and Goldberg's …