Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes (Q5163508): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3205762307 / rank | |||
Normal rank | |||
Latest revision as of 10:40, 30 July 2024
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
