If G is a multigraph which has a minor in F3, then all (≥ 1)-subdivisions of G and the line graphs of all (≥2)-subdivisions of G have twin-width at least 4. We determine the maximum number of edges of a simple n-vertex graph having some (≥1)-subdivision of twin-width at most 3.
Jun 8, 2023 · This answers a question of Bergé, Bonnet, and Déprés asking for the structure of graphs G such that each long subdivision of G has twin-width 4.
This answers a question of Bergé, Bonnet, and Déprés asking for the structure of graphs $G$ such that each long subdivision of $G$ has twin-width $4$.
Jun 25, 2023 · This answers a question of Berg\'{e}, Bonnet, and D\'{e}pr\'{e}s asking for the structure of graphs G G such that each long subdivision of G G ...
Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs · Mathematics, Computer Science. WG · 2022.
Jun 8, 2023 · 这回答了Berg\'{e}、Bonnet 和D\'{e}pr\'{e} 的问题，要求图$G$ 的结构使得$G$ 的每个长细分具有双宽度$4$。作为推论，我们表明$7\times7$ 网格具有双宽度$4 ...
Twin-width of subdivisions of multigraphs. CoRR, abs/2306.05334, 2023. [2] Stephen Alstrup, Søren Dahlgaard, and Mathias Bæk Tejs Knudsen. Optimal induced ...
Spectral integral variation of signed graphs -with Cheolwon Heo and Sunyo Moon, -arxiv:2401.02639. Twin-width of subdivisions of multigraphs
Twin-width of subdivisions of multigraphs (with J. Ahn, K. Hendrey, and S. Oum). Large rainbow matchings in edge-colored graphs (with P. Loh). Published Papers.