arXiv (All)
open access
Packing colourings of claw-free subcubic graphs
We prove that every claw-free subcubic graph admits a \packA-packing colouring, confirming a conjecture of Mortada, El Zein and Al Hajjar. The proof combines a reduction to line graphs of subdivided loopless cubic multigraphs with local colouring extensions. We also give a negative answer to their q
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 $(1,2^4)$ and $(1,2^5)$-packing edge-coloring of sparse subcubic graphs#793984
- On $(1,2^4)$ and $(1,2^5)$-packing edge-coloring of sparse subcubic graphs#789965
- Packing Diverse Shortest Cycles#1234196
- Obstructions to $k$-colouring $H$-free graphs#1247664
- A Polynomially Searchable Exponential Neighbourhood for Graph Colouring#824269
Record · ID 1456626
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