arXiv (All)
open access
Structure, Coloring, and Perfect Divisibility of $(P_2\cup P_4, C_3)$-Free Graphs
Goedgebeur and Schaudt [J. Graph Theory 87 (2018), 188-207] conjectured that every $4$-vertex-critical $(P_7,C_3)$-free graph belongs to a family of seven explicitly defined graphs. In this paper, we establish a structural theorem for connected $(P_2\cup P_4,C_3)$-free graphs. As a consequence, we p
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
- Small graphs without power-of-two cycles: a lower bound of 24, a correction to a construction of Exoo, and explicit bounds for f(k)#927953
- Towards a more structured search for Erdős-Gyárfás counter-examples#1076250
- On residual finiteness of graphs of free groups with cyclic edge groups#7899
- Induced subgraph density. IV. New graphs with the Erdős-Hajnal property#152970
- Monochromatic triangles with empty intersection and Kneser Ramsey numbers#1063368
Record · ID 987472
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