The chromaticity of complete bipartite graphs with at most one edge deleted (Q3496353): 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.3190140110 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054383364 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Two classes of chromatically unique graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Chromatic uniqueness of the generalized \(\Theta\)-graph / rank | |||
Normal rank | |||
Latest revision as of 11:01, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The chromaticity of complete bipartite graphs with at most one edge deleted |
scientific article |
Statements
The chromaticity of complete bipartite graphs with at most one edge deleted (English)
0 references
1990
0 references
chromatic polynomials
0 references
bipartitie graphs
0 references
chromatically unique
0 references
