arXiv (All)
open access
The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern
In this paper, we study the Pattern Avoidance problem of determining whether a given graph $G$ admits a linear vertex order which avoids a given pattern $P$, i.e., a vertex sequence with some forced and forbidden edges, on every suborder. Such patterns form a natural ordered counterpart to induced s
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
- The (Parameterized) Complexity of Ordering a Graph While Avoiding a Forbidden Pattern#808730
- Odd and Even Harder Problems on Cycle-Factors#1104900
- Fundamentals of domination in graphs#1179875
- Layer-Based Width for PAFP#819368
- Layer-Based Width for PAFP#809375
Record · ID 818722
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