Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes |
scientific article; zbMATH DE number 7420232
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes |
scientific article; zbMATH DE number 7420232 |
Statements
Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (English)
0 references
4 November 2021
0 references
graph homomorphism
0 references
max partial \(H\)-coloring problem
0 references
P5-free graphs
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
