Exact algorithms for finding longest cycles in claw-free graphs
type: Item
instance of: scholarly article
title: Exact algorithms for finding longest cycles in claw-free graphs
zbMATH Open document ID: 1259.05162
author: Fedor V. Fomin
author: Pim Van 't Hof
author: Daniël Paulusma
author: Hajo Broersma
published in: Algorithmica
publication date: 2013-03-05T00:00:00Z
full work available at URL: 9020.pdf
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6141211
zbMATH Keywords: Hamiltonian cycle problem
zbMATH Keywords: longest cycle problem
Wikidata QID: Q60488416
MaRDI profile type: Publication
OpenAlex ID: W1970923056
cites work: Inclusion and exclusion algorithm for the Hamiltonian path problem
cites work: Determinant Sums for Undirected Hamiltonicity
cites work: The Travelling Salesman Problem in Bounded Degree Graphs
cites work: Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs
cites work: Computing sharp 2-factors in claw-free graphs
cites work: Q5315023
cites work: Q3579494
cites work: Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions
cites work: The Traveling Salesman Problem for Cubic Graphs
cites work: Claw-free graphs---a survey
cites work: Q4198056
cites work: Finding and enumerating Hamilton cycles in 4-regular graphs
cites work: Q5572939
cites work: On Eulerian and Hamiltonian Graphs and Line Graphs
cites work: A Dynamic Programming Approach to Sequencing Problems
cites work: An Improved Exact Algorithm for Cubic Graph TSP
cites work: Dynamic programming meets the principle of inclusion and exclusion
cites work: Pancyclicity and NP-completeness in planar graphs
cites work: On the complexity of some edge-partition problems for graphs
cites work: HAMILTONian circuits in chordal bipartite graphs
cites work: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
cites work: On a closure concept in claw-free graphs
cites work: Open problems around exact algorithms
DBLP publication ID: journals/algorithmica/BroersmaFHP13
DOI: 10.1007/S00453-011-9576-4
description: scientific article; zbMATH DE number 6141211