A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs |
scientific article |
Statements
A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (English)
0 references
27 May 2022
0 references
conditional graph coloring
0 references
Brooks' theorem
0 references
Catlin's theorem
0 references
maximum \(G\)-free subgraph
0 references
graph partitioning
0 references
