arXiv (OAI Expanded)
open access
Parameterized complexity of $k$-Coloring in graphs with no long induced paths
We study the parameterized complexity of (List) $k$-Coloring in $H$-free graphs, where $H$ is a linear forest, that is, a disjoint union of paths. First, considering $k$ as the parameter, we establish the following: * For any $s \geq 0$, List $k$-Coloring in $(P_4+sP_1)$-free graphs is fixed-par
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
- A Brooks-like result for graph powers $#983875
- Proper conflict-free choosability of sparse graphs with girth at least seven#998793
- Sharp Rainbow Path Covers in Dense and Complete Multipartite Graphs#1012907
- Linear Tur'an Numbers of Four-Edge Uniform Paths via Incidence Rank#1033943
- Counting Weight-$k$ Italian Dominating Sets on Trees and Cycles#1154731
Record · ID 1069883
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