Parameterized algorithms in smooth 4-regular Hamiltonian graphs

DOI10.1007/s11786-007-0031-5zbMath1144.05064OpenAlexW2051613709MaRDI QIDQ943003

Egbert Mujuni

Publication date: 8 September 2008

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-007-0031-5

zbMATH Keywords

algorithmgraph coloringindependent setparameterized complexity

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Maximum independent sets in 3- and 4-regular Hamiltonian graphs

This page was built for publication: Parameterized algorithms in smooth 4-regular Hamiltonian graphs