Parameterized Algorithms in Smooth 4-Regular Hamiltonian Graphs |
| |
Authors: | Egbert Mujuni |
| |
Institution: | (1) University of Dar-es-Salaam, Box 35062, Dar es Salaam, Tanzania |
| |
Abstract: | Smooth 4-regular hamiltonian graphs are generalizations of cycle plus triangles graphs. It has been shown that both the independent
set and 3-colorability problems are NP-Complete in this class of graphs. In this paper we show that these problems are fixed
parameter tractable if we choose the number of inner cycles as parameter.
The reseach has been supported by International Science Programme (ISP) of Sweden, under the project titled “The Eastern African
Universities Mathematics Programme (EAUMP)”. |
| |
Keywords: | Mathematics Subject Classification (2000)" target="_blank">Mathematics Subject Classification (2000) Primary 05C85 Secondary 68Q85 |
本文献已被 SpringerLink 等数据库收录! |