Zobrazeno 1 - 2
of 2
pro vyhledávání: '"05C31, 05C20"'
The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components. The parame
Externí odkaz:
http://arxiv.org/abs/1803.08658
Publikováno v:
Journal of Graph Theory. 96:343-360
The chromatic polynomial $P(G,x)$ of a graph $G$ of order $n$ can be expressed as $\sum\limits_{i=1}^n(-1)^{n-i}a_{i}x^i$, where $a_i$ is interpreted as the number of broken-cycle free spanning subgraphs of $G$ with exactly $i$ components. The parame
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78656bd1e4bd4e07fc7f89b18fc13cdc
https://doi.org/10.1002/jgt.22617
https://doi.org/10.1002/jgt.22617
