Author:
Huynh Tony,Joret Gwenaël,Micek Piotr,Seweryn Michał T.,Wollan Paul
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference21 articles.
1. K. Ando, H. Enomoto and A. Saito: Contractible edges in 3-connected graphs, Journal of Combinatorial Theory, Series B 42 (1987), 87–93.
2. R. Diestel: Graph Theory, Springer Publishing Company, Incorporated, 5th edition, 2017.
3. P. Erdős and G. Szekeres: A combinatorial problem in geometry, Compositio Math. 2 (1935), 463–470.
4. M. Gorsky and M. T. Seweryn: Posets with k-outerplanar cover graphs have bounded dimension, arXiv:2103.15920.
5. R. Halin: Untersuchengen über minimale n-fach zusammenhängende graphen, Mathematische Annalen 182 (1969), 175–188.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A graph searching game for block treedepth and a cubic kernel by vertex cover;Theoretical Computer Science;2024-10
2. Block Elimination Distance;Graphs and Combinatorics;2022-08-05
3. Block Elimination Distance;Graph-Theoretic Concepts in Computer Science;2021