Author:
Abu-Khzam Faisal N.,Langston Michael A.
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Béla Bollobás. Extremal Graph Theory. Academic Press, 1978.
2. H. D. Booth, R. Govindan, M. A. Langston, and S. Ramachandramurthi. Sequential and parallel algorithms for K 4 immersion testing. Journal of Algorithms, 30:344–378, 1999.
3. Catlin. Hajös graph-coloring conjecture: variation and counterexamples. JCTB, 26:268–274, 1979.
4. G. A. Dirac. A property of 4-chromatic graphs and some remarks on critical graphs. J. London Math. Soc., 27:85–92, 1952.
5. P. Duchet and H. Meyniel. On Hadwiger’s number and the stability number. Annals of Discrete Math., 13:71–74, 1982.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sublinear Expanders and Their Applications;Surveys in Combinatorics 2024;2024-06-13
2. A Note on the Immersion Number of Generalized Mycielski Graphs;Springer Proceedings in Mathematics & Statistics;2024
3. Clique immersion in graph products;Discrete Mathematics;2023-08
4. Biclique immersions in graphs with independence number 2;Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications;2023
5. Forcing clique immersions through chromatic number;European Journal of Combinatorics;2019-10