On the Parameterized Complexity of $k$-Edge Colouring

January 07, 2019 · The Ethereal · 🏛 arXiv.org

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries arXiv ID 1901.01861 Category cs.DM: Discrete Mathematics Cross-listed cs.CC, cs.DS, math.CO Citations 5 Venue arXiv.org Last Checked 2 months ago
Abstract
For every fixed integer $k \geq 1$, we prove that $k$-Edge Colouring is fixed-parameter-tractable when parameterized by the number of vertices of maximum degree.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Discrete Mathematics