Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Algorithm for deriving the chromatic polynomial of a graph

From MaRDI portal
Publication:1215637
Jump to:navigation, search

DOI10.1007/BF02242318zbMath0301.05106OpenAlexW164431218MaRDI QIDQ1215637

K. R. James, W. Riha

Publication date: 1975

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242318



Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Software, source code, etc. for problems pertaining to combinatorics (05-04)


Related Items (1)

Algorithm for deriving the chromatic polynomial of a graph



Cites Work

  • Algorithm for deriving the chromatic polynomial of a graph
  • Algorithm for generating graphs of a given partition
  • An introduction to chromatic polynomials
  • Unnamed Item
  • Unnamed Item


This page was built for publication: Algorithm for deriving the chromatic polynomial of a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1215637&oldid=13284897"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki