Richard Ueltzen. Characterizing graphs with high inducibility. // Journal of Combinatorial Theory, Series B. – 2027. – DOI: 10.1016/j.jctb.2026.09.011. – URL: https://doi.org/10.1016/j.jctb.2026.09.011
Richard Ueltzen (2027). Characterizing graphs with high inducibility. Journal of Combinatorial Theory, Series B. https://doi.org/10.1016/j.jctb.2026.09.011
Richard Ueltzen. “Characterizing graphs with high inducibility.” Journal of Combinatorial Theory, Series B, 2027. doi:10.1016/j.jctb.2026.09.011.
@article{Ueltzen2027,
title = {Characterizing graphs with high inducibility},
author = {Ueltzen, Richard},
journal = {Journal of Combinatorial Theory, Series B},
year = {2027},
doi = {10.1016/j.jctb.2026.09.011},
url = {https://doi.org/10.1016/j.jctb.2026.09.011}
}