Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Xiao Wang / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C60 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6691082 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
chromatic number | |||
Property / zbMATH Keywords: chromatic number / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
triangle-free graph | |||
Property / zbMATH Keywords: triangle-free graph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
induced subgraph | |||
Property / zbMATH Keywords: induced subgraph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
forbidden subgraph | |||
Property / zbMATH Keywords: forbidden subgraph / rank | |||
Normal rank |
Revision as of 04:21, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree |
scientific article |
Statements
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (English)
0 references
3 March 2017
0 references
chromatic number
0 references
triangle-free graph
0 references
induced subgraph
0 references
forbidden subgraph
0 references