@article{MTMT:36404839, title = {Local algorithms for the maximum flow and minimum cut in bounded-degree networks}, url = {https://m2.mtmt.hu/api/publication/36404839}, author = {Csóka, Endre and Pongrácz, András}, journal-iso = {J GRAPH THEOR}, journal = {JOURNAL OF GRAPH THEORY}, volume = {Accepted: 2025}, unique-id = {36404839}, issn = {0364-9024}, keywords = {Approximation algorithms; Graph algorithms; Randomized Algorithms; Property testing; LOCAL ALGORITHMS; bounded-degree graphs}, year = {2026}, eissn = {1097-0118}, pages = {&} } @article{MTMT:37074711, title = {Variants of local algorithms on sparse graphs}, url = {https://m2.mtmt.hu/api/publication/37074711}, author = {Csóka, Endre}, journal-iso = {J GRAPH THEOR}, journal = {JOURNAL OF GRAPH THEORY}, volume = {accepted: 2025}, unique-id = {37074711}, issn = {0364-9024}, year = {2026}, eissn = {1097-0118}, pages = {&} } @article{MTMT:37075211, title = {Stable cuts, NAC-colourings and flexible realisations of graphs}, url = {https://m2.mtmt.hu/api/publication/37075211}, author = {Katie, Clinch and Garamvölgyi, Dániel and John, Haslegrave and Tony, Huynh and Jan, Legerský and Anthony, Nixon}, journal-iso = {J GRAPH THEOR}, journal = {JOURNAL OF GRAPH THEORY}, volume = {Accepted: 2025}, unique-id = {37075211}, issn = {0364-9024}, year = {2026}, eissn = {1097-0118}, pages = {&}, orcid-numbers = {Garamvölgyi, Dániel/0000-0002-8468-6585} } @article{MTMT:37122690, title = {Sensitivity and Hamming Graphs}, url = {https://m2.mtmt.hu/api/publication/37122690}, author = {Asensio, Sara and Filmus, Yuval and Garcia-Marco, Ignacio and Knauer, Kolja}, doi = {10.1002/jgt.70034}, journal-iso = {J GRAPH THEOR}, journal = {JOURNAL OF GRAPH THEORY}, unique-id = {37122690}, issn = {0364-9024}, year = {2026}, eissn = {1097-0118} } @article{MTMT:37122696, title = {On Tight Tree-Complete Hypergraph Ramsey Numbers}, url = {https://m2.mtmt.hu/api/publication/37122696}, author = {Nie, Jiaxi}, doi = {10.1002/jgt.70054}, journal-iso = {J GRAPH THEOR}, journal = {JOURNAL OF GRAPH THEORY}, unique-id = {37122696}, issn = {0364-9024}, year = {2026}, eissn = {1097-0118} } @article{MTMT:37126024, title = {On Strongly and Robustly Critical Graphs}, url = {https://m2.mtmt.hu/api/publication/37126024}, author = {Bernshteyn, Anton and Kaul, Hemanshu and Mudrock, Jeffrey A. and Sharma, Gunjan}, doi = {10.1002/jgt.70033}, journal-iso = {J GRAPH THEOR}, journal = {JOURNAL OF GRAPH THEORY}, unique-id = {37126024}, issn = {0364-9024}, keywords = {list coloring; Graph coloring; Critical graph; DP-coloring; correspondence coloring; robustly critical graph; strong chromatic choosability; strongly critical graph}, year = {2026}, eissn = {1097-0118} } @article{MTMT:37126026, title = {Towards Characterization of Five-List-Colorability of Toroidal Graphs}, url = {https://m2.mtmt.hu/api/publication/37126026}, author = {Dvorak, Zdenek and Penarrubia, Felix Moreno}, doi = {10.1002/jgt.70031}, journal-iso = {J GRAPH THEOR}, journal = {JOURNAL OF GRAPH THEORY}, unique-id = {37126026}, issn = {0364-9024}, year = {2026}, eissn = {1097-0118} } @article{MTMT:37126063, title = {Turán Problems for Suspension of a Balanced Tree}, url = {https://m2.mtmt.hu/api/publication/37126063}, author = {Zhu, Xiutao and Wang, Xiaolin and Zhang, Yanbo and Zhang, Fangfang}, doi = {10.1002/jgt.70053}, journal-iso = {J GRAPH THEOR}, journal = {JOURNAL OF GRAPH THEORY}, unique-id = {37126063}, issn = {0364-9024}, keywords = {suspension; balanced tree; Tur & aacute;n problem}, year = {2026}, eissn = {1097-0118} } @article{MTMT:37126336, title = {Anti-Directed Cycle-Factors in Oriented Graphs}, url = {https://m2.mtmt.hu/api/publication/37126336}, author = {Chen, Ming}, doi = {10.1002/jgt.70055}, journal-iso = {J GRAPH THEOR}, journal = {JOURNAL OF GRAPH THEORY}, unique-id = {37126336}, issn = {0364-9024}, year = {2026}, eissn = {1097-0118} } @article{MTMT:37127311, title = {Tight Bounds for Hypercube Minor-Universality}, url = {https://m2.mtmt.hu/api/publication/37127311}, author = {Hogan, Emma and Michel, Lukas and Scott, Alex and Tamitegama, Youri and Tan, Jane and Tsarev, Dmitry}, doi = {10.1002/jgt.70035}, journal-iso = {J GRAPH THEOR}, journal = {JOURNAL OF GRAPH THEORY}, unique-id = {37127311}, issn = {0364-9024}, year = {2026}, eissn = {1097-0118}, orcid-numbers = {Hogan, Emma/0009-0007-5610-4158} }