Linked-cluster expansion of the graph-vertex coloration problem (Q2533376): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A logical expansion in mathematics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lattice Constant Systems and Graph Theory / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Percolation Processes. I. Low-Density Expansion for the Mean Number of Clusters in a Random Mixture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On dichromatic polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new subgraph expansion for obtaining coloring polynomials for graphs / rank | |||
Normal rank |
Latest revision as of 23:12, 11 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linked-cluster expansion of the graph-vertex coloration problem |
scientific article |
Statements
Linked-cluster expansion of the graph-vertex coloration problem (English)
0 references
1969
0 references
topology
0 references
0 references