Planar graph with twin-width seven
From MaRDI portal
Publication:6614402
DOI10.1016/j.ejc.2023.103749zbMATH Open1548.05098MaRDI QIDQ6614402
Publication date: 7 October 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An introduction to the discharging method via graph coloring
- Notes on graph product structure theory
- Twin-width and generalized coloring numbers
- On the total coloring of planar graphs.
- Bounds for the Twin-Width of Graphs
- Twin-width I: Tractable FO Model Checking
- Graphs of bounded twin-width are quasi-polynomially \(\chi \)-bounded
- Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs
- Twin-width IV: ordered graphs and matrices
- Compact representation for matrices of bounded twin-width
- A brief tour in twin-width (invited talk)
- Deciding twin-width at most 4 is NP-complete
- Twin-width. VI: The lens of contraction sequences
- Graph product structure for \(h\)-framed graphs
Related Items (1)
This page was built for publication: Planar graph with twin-width seven
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614402)
