arXiv (All)
open access
Ramsey Meets Simultaneous Planarity: Vertex Integrity and Pathwidth
We study the following simultaneous embedding problem: Given k graphs on the same vertex set with the same pairwise intersection, do they admit planar drawings that coincide on their shared graph? We establish fixed-parameter tractability with respect to the vertex integrity of the union graph (that
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Ramsey properties of maximal (outer)planar graphs#972204
- Proper conflict-free choosability of sparse graphs with girth at least seven#998793
- Extremal problems for cancellative and locally thin hypergraphs#986484
- A Brooks-like result for graph powers $#983875
- Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates#1011663
Record · ID 1327982
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive