arXiv (All)
open access
A forbidden-induced-subgraph characterization of beautiful graphs
A graph is beautiful if each of its induced subgraphs is the intersection graph of all maximal nonempty 1-rectangles of a binary matrix, with adjacency defined by a common cell. Beautiful graphs were introduced as a hereditary class of Berge graphs, but a complete forbidden-induced-subgraph characte
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
- Induced subgraphs and tree decompositions XVIII. Obstructions to bounded pathwidth#1051978
- A unified framework for existing and new constructions of Neumaier graphs#1156545
- Extremal problems for cancellative and locally thin hypergraphs#986484
- A linear upper bound for Berge saturation numbers#1248689
- LLM-Aided A* Search in Non-Geometric Network Graphs#299858
Record · ID 1217659
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