Citation
Matthias Hamann. Quasi-transitive <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e22" altimg="si2.svg"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>∞</mml:mi></mml:mrow></mml:msub></mml:math>-minor free graphs. // European Journal of Combinatorics. – 2025. – DOI: 10.1016/j.ejc.2024.104056. – URL: https://doi.org/10.1016/j.ejc.2024.104056
Matthias Hamann (2025). Quasi-transitive <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e22" altimg="si2.svg"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>∞</mml:mi></mml:mrow></mml:msub></mml:math>-minor free graphs. European Journal of Combinatorics. https://doi.org/10.1016/j.ejc.2024.104056
Matthias Hamann. “Quasi-transitive <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e22" altimg="si2.svg"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>∞</mml:mi></mml:mrow></mml:msub></mml:math>-minor free graphs.” European Journal of Combinatorics, 2025. doi:10.1016/j.ejc.2024.104056.
@article{Hamann2025,
title = {Quasi-transitive <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e22" altimg="si2.svg"><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>∞</mml:mi></mml:mrow></mml:msub></mml:math>-minor free graphs},
author = {Hamann, Matthias},
journal = {European Journal of Combinatorics},
year = {2025},
doi = {10.1016/j.ejc.2024.104056},
url = {https://doi.org/10.1016/j.ejc.2024.104056}
}