The complexity of \(G\)-free colourability (Q1356726): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The existence of uniquely \(-G\) colourable graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On generalized graph colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3351379 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: ON UNIQUELY -G k-COLOURABLE GRAPHS / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4100121 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5560916 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The point-arboricity of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs with unique Ramsey colorings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3220612 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4111618 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5613120 / rank | |||
Normal rank |
Latest revision as of 13:12, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complexity of \(G\)-free colourability |
scientific article |
Statements
The complexity of \(G\)-free colourability (English)
0 references
5 November 1998
0 references
chromatic number
0 references
2-colourable
0 references
polynomial time algorithm
0 references
bipartition
0 references
NP-complete
0 references