arXiv (All)
open access
Local Ore Conditions for Rainbow Pancyclicity and Vertex-Pancyclicity in Graph Systems
We investigate rainbow pancyclicity and vertex-pancyclicity of graph systems satisfying a local Ore-type degree condition. All graphs in the system share the same vertex set. We prove that if each graph is 2-connected and satisfies our local Ore condition, then the graph system is either rainbow pan
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
- Sub-quorum colorings of some infinite families of caterpillars#1144586
- Learning for Graph Matching and Related Combinatorial Optimization Problems#478214
- Rainbow Dominating Sets of Graphs#200313
- The complexity of entangled graph colouring via polymorphisms#1186879
- 2-colouring shift-chains#1106248
Record · ID 1388993
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