Parameterized Algorithms in Smooth 4-Regular Hamiltonian Graphs

Simple item page
dc.contributor.authorMujuni, Egbert
dc.date.accessioned2016-09-21T13:23:29Z
dc.date.available2016-09-21T13:23:29Z
dc.date.issued2008
dc.descriptionFull text can be accessed at http://link.springer.com/article/10.1007/s11786-007-0031-5en_US
dc.description.abstractSmooth 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.en_US
dc.identifier.citationMujuni, E., 2008. Parameterized algorithms in smooth 4-regular Hamiltonian graphs. Mathematics in Computer Science, 1(4), pp.701-708.en_US
dc.identifier.doi10.1007/s11786-007-0031-5
dc.identifier.issn1661-8289
dc.identifier.urihttp://hdl.handle.net/20.500.11810/3930
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectAlgorithmen_US
dc.subjectParameterized complexityen_US
dc.subjectGraph coloringen_US
dc.subjectIndependent seten_US
dc.titleParameterized Algorithms in Smooth 4-Regular Hamiltonian Graphsen_US
dc.typeJournal Article, Peer Revieweden_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Parameterized Algorithms in Smooth 4-Regular Hamiltonian Graphs.pdf
Size:
5.81 KB
Format:
Adobe Portable Document Format
Description:
Abstract
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Department of Mathematics