A simple quadratic kernel for token jumping on surfaces

DOI10.1007/978-3-032-11835-6_11MaRDI QIDQ7294427zbMATH OpenFDO

Authors Daniel W. Cranston, Moritz Mühlenthaler, Benjamin Peyrille

Publication date 10 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-11835-6_11

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A survey on the parameterized complexity of reconfiguration problems
• Das Geschlecht des vollständigen paaren Graphen
• Efficient Planarity Testing
• Every Planar Map is Four Colorable
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Fixed-parameter tractability of token jumping on planar graphs
• Graphs on surfaces
• scientific article; zbMATH DE number 1256776 (Why is no real title available?)
• Independent set reconfiguration in H-free graphs
• Introduction to reconfiguration
• Map-colour theorem.
• On girth and the parameterized complexity of token sliding and token jumping
• Orientable and non orientable genus of the complete bipartite graph
• Parameterized complexity of graph constraint logic
• Reconfiguration on sparse graphs
• The complexity of change
• Token jumping in minor-closed classes

This page was built for publication: A simple quadratic kernel for token jumping on surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294427)