|
|
(5 intermediate revisions by 4 users not shown) |
Property / author | |
| | |
Property / author: Dmitriy S. Malyshev / rank | |
| Normal rank
| |
| Property / author |
| | |
| Property / author: Dmitriy S. Malyshev / rank |
| | Normal rank |
| Property / MaRDI profile type |
| | |
| Property / MaRDI profile type: MaRDI publication profile / rank |
| | Normal rank |
| Property / full work available at URL |
| | |
| Property / full work available at URL: https://doi.org/10.1007/s11590-020-01679-9 / rank |
| | Normal rank |
| Property / OpenAlex ID |
| | |
| Property / OpenAlex ID: W3118332917 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Hereditary graph classes: When the complexities of <scp>coloring</scp> and <scp>clique cover</scp> coincide / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Three-coloring and list three-coloring of graphs without induced paths on seven vertices / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Updating the complexity status of coloring graphs without a fixed induced linear forest / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The class of (P7,C4,C5)‐free graphs: Decomposition, algorithms, and χ‐boundedness / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Structure and algorithms for (cap, even hole)-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Colouring diamond-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On coloring a class of claw-free graphs. / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The intersection of two vertex coloring problems / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Characterizations of \((4 K_1,C_4,C_5)\)-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4198056 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Colouring square-free graphs without long induced paths / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: 4-coloring \(H\)-free graphs when \(H\) is small / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Complexity of coloring graphs without paths and cycles / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Improved complexity results on \(k\)-coloring \(P_t\)-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q5755526 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Polynomial cases for the vertex coloring problem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Q4448764 / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Colouring \((P_r + P_s)\)-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Vertex coloring of graphs with few obstructions / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The coloring problem for classes with two small obstructions / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Two cases of polynomial-time solvability for the coloring problem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: The weighted coloring problem for two graph classes characterized by small forbidden induced structures / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Two complexity results for the vertex coloring problem / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: A complete classification of the complexity of the vertex 3-colourability problem for quadruples of induced 5-vertex prohibitions / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: On the Complexity of the Vertex 3-Coloring Problem for the Hereditary Graph Classes With Forbidden Subgraphs of Small Size / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Four-coloring <i>P</i><sub>6</sub>-free graphs / rank |
| | Normal rank |
| Property / cites work |
| | |
| Property / cites work: Decomposition by clique separators / rank |
| | Normal rank |
links / mardi / name | links / mardi / name |
| | |