WOLFRAM
Products
Wolfram|One
Mathematica
Wolfram Notebook Assistant + LLM Kit
Wolfram|Alpha Notebook Edition
System Modeler
All Products
Consulting & Solutions
Wolfram Consulting
Industry Solutions
Solutions for Education
Learning & Support
Wolfram U Courses
Wolfram Language Resources
Wolfram Community
Support FAQs
Contact Support
Company
About Wolfram
Careers
Events
Educational Programs
All Sites and Resources
Wolfram|Alpha
Wolfram Cloud
Your Account
Your Account
User Portal
Search
Close
Enable JavaScript to interact with content and submit forms on Wolfram websites.
Learn how
For the newest resources, visit
Wolfram Repositories and Archives »
Title
How to Color a Graph with (Computer) Algebra
Author
Yuri Matiyasevich
URL:
http://logic.pdmi.ras.ru/~yumat
Journal / Anthology
The Mathematica Journal
Year:
2002
Volume:
8
Issue:
4
Page range:
586-590
Description
This note presents some nonevident ways for determining the colorability of a graph and the number of its colorings via algebraic manipulations of polynomials in many variables.
Subject
Mathematics
>
Discrete Mathematics
>
Graph Theory
Keywords
graph coloring, coloring, colorings, graphs, chromatic polynomial, chromatic number, colorable, ColorableQ, number of colorings
URL
http://logic.pdmi.ras.ru/~yumat/Journal/Triangular/triang.htm
http://www.mathematica-journal.com/issue/v8i4/features/matiyasevich/contents/ColorGraph.html
For the newest resources, visit Wolfram Repositories and Archives »
