Twin-width of subdivisions of multigraphs
From MaRDI portal
Distance in graphs (05C12) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph minors (05C83) Graph theory (including graph drawing) in computer science (68R10)
Cites work
- A Linear Recognition Algorithm for Cographs
- A partial k-arboretum of graphs with bounded treewidth
- A SAT approach to twin-width
- Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
- Bounds for the twin-width of graphs
- Deciding twin-width at most 4 is NP-complete
- Grid induced minor theorem for graphs of small degree
- scientific article; zbMATH DE number 7803584 (Why is no real title available?)
- Internally 4-connected graphs with no \(\{\text{cube}, V_8\}\)-minor
- On the tree-width of even-hole-free graphs
- Stable graphs of bounded twin-width
- Steiner trees, partial 2–trees, and minimum IFI networks
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Twin-width and generalized coloring numbers
- Twin-width and permutations
- Twin-width and polynomial kernels
- Twin-width II: small classes
- Twin-width of random graphs
- Twin-width. I: Tractable FO model checking
- Twin-width. III: Max independent set, min dominating set, and coloring
- Twin-width. IV: Ordered graphs and matrices
- Twin-width. VI: The lens of contraction sequences
- Weighted model counting with twin-width
Cited in
(3)
This page was built for publication: Twin-width of subdivisions of multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6986956)
