3 years ago

On the Parameterized Complexity of $k$-Edge Colouring.

Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries

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.

Publisher URL: http://arxiv.org/abs/1901.01861

DOI: arXiv:1901.01861v2

You might also like
Discover & Discuss Important Research

Keeping up-to-date with research can feel impossible, with papers being published faster than you'll ever be able to read them. That's where Researcher comes in: we're simplifying discovery and making important discussions happen. With over 19,000 sources, including peer-reviewed journals, preprints, blogs, universities, podcasts and Live events across 10 research areas, you'll never miss what's important to you. It's like social media, but better. Oh, and we should mention - it's free.

  • Download from Google Play
  • Download from App Store
  • Download from AppInChina

Researcher displays publicly available abstracts and doesn’t host any full article content. If the content is open access, we will direct clicks from the abstracts to the publisher website and display the PDF copy on our platform. Clicks to view the full text will be directed to the publisher website, where only users with subscriptions or access through their institution are able to view the full article.