The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial (Q2897206): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.20614 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1568279347 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5313291 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Zero-Free Intervals for Flow Polynomials of Near-Cubic Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An introduction to chromatic polynomials / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Cutpoints and the chromatic polynomial / rank | |||
Normal rank | |||
Latest revision as of 11:20, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial |
scientific article |
Statements
The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial (English)
0 references
10 July 2012
0 references
connectivity
0 references
chromatic polynomial
0 references
chromatic zero
0 references
