HAL (France)
open access
Partitions of Planar (Oriented) Graphs into a Connected Acyclic and an Independent Set
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
- On finite groups whose coprime graph is a divisor graph#1143581
- A comment on "Overperception of moral outrage in online social networks inflates beliefs about intergroup hostility"#471701
- On the vertex connectivity of weakly zero-divisor graph of commutative rings#822505
- Breaking the Exponential Barrier: The First Polynomial-Time Algorithm for the Győri-Lovász Theorem#818987
- Breaking the Exponential Barrier: The First Polynomial-Time Algorithm for the Győri-Lovász Theorem#808995
Record · ID 333910
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