Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Thomas, Robin
1989.
Well-quasi-ordering infinite graphs with forbidden finite planar minor.
Transactions of the American Mathematical Society,
Vol. 312,
Issue. 1,
p.
279.
Kříž, Igor
1989.
Proving a witness lemma in better-quasiordering theory: the method of ‘extensions’.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 106,
Issue. 2,
p.
253.
Hazewinkel, M.
1990.
Encyclopaedia of Mathematics.
p.
67.
Oporowski, Bogdan
1990.
A counterexample to Seymour's self‐minor conjecture.
Journal of Graph Theory,
Vol. 14,
Issue. 5,
p.
521.
Robertson, Neil
Seymour, Paul
and
Thomas, Robin
1991.
Excluding infinite minors.
Discrete Mathematics,
Vol. 95,
Issue. 1-3,
p.
303.
Komjáth, Péter
1995.
A note on minors of uncountable graphs.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 117,
Issue. 1,
p.
7.
Pagurova, V. I.
Sokolov, D. D.
Marchenko, S. S.
Ershov, A. P.
Shtern, A. I.
Kudryavtsev, L. D.
Postnikov, M. M.
Orlov, A. I.
Nesterenko, Yu. V.
Skvortsov, V. A.
Filippov, V. T.
Merzlyakov, Yu. I.
Shmel’kin, A. L.
Stepanov, S. A.
Chernavskiĭ, A. V.
Malakhovskiĭ, V. S.
Bredikhin, B. M.
Nikulin, M. S.
Kudryavtsev, V. B.
Sobolev, V. I.
Kharshiladze, A. F.
Solomentsev, E. D.
Bazylev, V. T.
Arkhangel’skiĭ, A. V.
Kreĭn, S. G.
Prokhorov, A. V.
Sevast’yanov, V. A.
Zubkov, A. M.
Sevast’yanov, B. A.
Chistyakov, V. P.
Korneĭchuk, N. P.
Motornyĭ, V. P.
Malyshev, A. V.
Motornyi, V. P.
Shiryadev, A. N.
Khas’minskiĭ, R. Z.
Shiryaev, A. N.
Shur, M. G.
Ivanov, A. B.
Nikol’skiĭ, S. M.
Kantorovich, L. D.
Makarov, V. L.
Adyan, S. I.
Gladkiĭ, A. V.
Tikhonov, A. N.
Samarskiĭ, A. A.
Sveshnikov, A. G.
Vladimirov, V. S.
Karmanov, V. G.
Kolmogorov, A. N.
Prokhorov, Yu. V.
Rozenberg, G.
Salomaa, A.
Starzhinskiĭ, V. M.
Fedoryuk, M. V.
Strunkov, S. P.
Suprunenko, D. A.
Tonkov, E. L.
Germogenova, T. A.
Korbut, A. A.
Volkov, I. I.
Sapozhenko, A. A.
Popov, V. L.
Rumyantsev, V. V.
Onishchik, A. L.
Loginov, A. I.
Shul’man, V. S.
Gorbatsevich, V. V.
Sarmanov, I. O.
Anosov, D. V.
Govorov, V. E.
Shevrin, L. N.
Vil’yams, N. N.
Vorob’ev, N. N.
Fedorov, V. V.
Ivanilov, Yu. P.
Okhrimenko, V. V.
Yaglom, A. M.
Ibragimov, I. A.
Kukin, V. D.
Vapnyarskiĭ, I. B.
Sidorov, L. A.
Sazonov, V. V.
Terekhin, A. P.
Minlos, R. A.
Galochkin, A. I.
Vaĭnikko, G. M.
Modenov, P. S.
Nechaev, V. I.
Brychkov, Yu. A.
Prudnikov, A. P.
Mysovskikh, I. P.
Lizorkin, P. I.
Dobrushin, R. L.
Prelov, V. V.
Pasynkov, B. A.
Voĭtsekhovskiĭ, M. I.
Golubov, B. I.
Korotkov, V. B.
Chirka, E. M.
Ponomarev, D. A.
Dragalin, A. G.
Marchuk, G. I.
Alenitsyn, Yu. E.
Davydov, Yu. M.
Evtushik, L. E.
Bakhvalov, N. S.
Lumiste, Ü.
Berdyshev, V. I.
Sabitov, I. Kh.
Ul’yanov, P. L.
Sprindzhuk, V. G.
Kaneko, A.
Rozov, N. Kh.
Pospelov, V. V.
Chuyanov, V. A.
Rudyak, Yu. B.
Kuznetsov, Yu. A.
Sobolev, S. K.
Nikolaev, E. S.
Iskovskikh, V. A.
Talalyan, A. A.
Fomenko, A. T.
Kholevo, A. S.
Yanovskaya, E. B.
Rakitskiĭ, Yu. V.
Goluzina, E. G.
D’yakonov, E. G.
Subbotin, Yu. N.
Zalgaller, V. A.
Kovalevskaya, E. I.
Remeslennikov, V. N.
Nakhushev, A. M.
Mikhaĭlov, V. P.
Ivanova, O. A.
Khvedelidze, B. V.
Nakushev, A. M.
Burago, Yu. D.
Klimov, N. I.
Afanas’ev, V. V.
Smirnov, D. M.
Grishin, V. N.
Taĭmanov, A. D.
Taĭtslin, M. A.
Panchishkin, A. A.
Parshin, A. N.
Zhevlakov, K. A.
Skornyakov, L. A.
Kuz’min, L. V.
Mikhalev, A. V.
Kuz’mina, G. V.
and
Kaz’min, Yu. A.
1995.
Encyclopaedia of Mathematics.
p.
723.
Diestel, Reinhard
and
Thomas, Robin
1999.
Excluding a Countable Clique.
Journal of Combinatorial Theory, Series B,
Vol. 76,
Issue. 1,
p.
41.
Andreae, Thomas
2002.
On disjoint configurations in infinite graphs.
Journal of Graph Theory,
Vol. 39,
Issue. 4,
p.
222.
Andreae, Thomas
2002.
On the Immersion Relation and an Embedding Problem for Infinite Graphs.
Results in Mathematics,
Vol. 41,
Issue. 1-2,
p.
18.
Andreae, Thomas
2003.
On immersions of uncountable graphs.
Journal of Combinatorial Theory, Series B,
Vol. 87,
Issue. 1,
p.
130.
Nigussie, Yared
and
Robertson, Neil
2005.
On structural descriptions of lower ideals of trees.
Journal of Graph Theory,
Vol. 50,
Issue. 3,
p.
220.
Andreae, Thomas
2008.
On self‐immersions of infinite graphs.
Journal of Graph Theory,
Vol. 58,
Issue. 4,
p.
275.
Cerioli, Márcia R.
Nobrega, Hugo
and
Viana, Petrucio
2011.
On characterizations by nice forbidding sets.
Electronic Notes in Discrete Mathematics,
Vol. 38,
Issue. ,
p.
233.
Barnes, Matthew
and
Oporowski, Bogdan
2019.
A note on immersion intertwines of infinite graphs.
Journal of Graph Theory,
Vol. 92,
Issue. 1,
p.
57.
Bowler, Nathan
Elbracht, Christian
Erde, Joshua
Gollin, J. Pascal
Heuer, Karl
Pitz, Max
and
Teegen, Maximilian
2022.
Topological ubiquity of trees.
Journal of Combinatorial Theory, Series B,
Vol. 157,
Issue. ,
p.
70.
Pitz, Max
2023.
A note on minor antichains of uncountable graphs.
Journal of Graph Theory,
Vol. 102,
Issue. 3,
p.
552.
Liu, Chun-Hung
and
Muzi, Irene
2023.
Well-quasi-ordering digraphs with no long alternating paths by the strong immersion relation.
Journal of Combinatorial Theory, Series B,
Vol. 158,
Issue. ,
p.
210.
Bowler, Nathan
Elbracht, Christian
Erde, Joshua
Gollin, J. Pascal
Heuer, Karl
Pitz, Max
and
Teegen, Maximilian
2023.
Ubiquity of graphs with nowhere‐linear end structure.
Journal of Graph Theory,
Vol. 103,
Issue. 3,
p.
564.
Pitz, Max
2024.
Applications of Order Trees in Infinite Graphs.
Order,
Vol. 41,
Issue. 1,
p.
65.