( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improved Pyrotechnics: Closer to the Burning Number Conjecture.

, , , , , , и . Electron. J. Comb., (2023)

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.

Elke Pierron

Nicolaos Théodorou

Théo Trouillon

Wolfgang Theobald

Panagiotis Theodorou

 

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

Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy., , , , , и . Algorithmica, 83 (3): 822-852 (2021)On the signed chromatic number of some classes of graphs., , , , , и . CoRR, (2020)Strengthening a theorem of Meyniel., , , , и . CoRR, (2022)Improved pyrotechnics : Closer to the burning graph conjecture., , , , и . CoRR, (2021)Improved square coloring of planar graphs., , , и . Discret. Math., 346 (4): 113288 (апреля 2023)Coloring squares of graphs with mad constraints., , и . Discret. Appl. Math., (2019)Every planar graph with Δ≥8 is totally (Δ+2)-choosable., , и . CoRR, (2019)Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes., , и . DISC, том 209 из LIPIcs, стр. 49:1-49:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Square Coloring Planar Graphs with Automatic Discharging., , , и . SIAM J. Discret. Math., 38 (1): 504-528 (марта 2024)Recoloring Planar Graphs of Girth at Least Five., , , , , и . SIAM J. Discret. Math., 37 (1): 332-350 (марта 2023)