( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Bounding clique-width via perfect graphs.

, , и . J. Comput. Syst. Sci., (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Marylena Dabrowski

Karl Dabrowski

Erwin Dabrowski

Martin Dabrowski

Wieslaw Dabrowski

 

Другие публикации лиц с тем же именем

Tree pivot-minors and linear rank-width., , , , , , и . CoRR, (2020)On colouring (2P2, H)-free and (P5, H)-free graphs., и . Inf. Process. Lett., (2018)Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs., и . Comput. J., 59 (5): 650-666 (2016)Computing Small Pivot-Minors., , , , , , и . WG, том 11159 из Lecture Notes in Computer Science, стр. 125-138. Springer, (2018)Colouring vertices of triangle-free graphs without forests., , , и . Discret. Math., 312 (7): 1372-1385 (2012)An Algorithmic Framework for Locally Constrained Homomorphisms., , , , и . WG, том 13453 из Lecture Notes in Computer Science, стр. 114-128. Springer, (2022)On the price of independence for vertex cover, feedback vertex set and odd cycle transversal., , , , и . Eur. J. Comb., (марта 2024)Independent Feedback Vertex Set for P_5-free Graphs., , , , и . ISAAC, том 92 из LIPIcs, стр. 16:1-16:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Tree Pivot-Minors and Linear Rank-Width., , , , , , и . SIAM J. Discret. Math., 35 (4): 2922-2945 (2021)Solving infinite-domain CSPs using the patchwork property., , , и . Artif. Intell., (апреля 2023)