On Computing the Hamiltonian Index of Graphs

DOI10.1007/978-3-030-50026-9_25OpenAlexW3036922677MaRDI QIDQ5042256

M. R. Rani, R. Subashini, Geevarghese Philip

Publication date: 19 October 2022

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.01990

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items

On the parameterized complexity of the connected flow and many visits TSP problem

Cites Work

• Approximate tree decompositions of planar graphs in linear time
• Fundamentals of parameterized complexity
• Hamiltonian index is NP-complete
• Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
• The Hamiltonian index of graphs
• The edge Hamiltonian path problem is NP-complete
• A partial k-arboretum of graphs with bounded treewidth
• Hamiltonian iterated line graphs
• On the parameterized complexity of edge-linked paths
• Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth
• Parameterized edge Hamiltonicity
• Parametrized complexity theory.
• A note on graphs spanned by Eulerian graphs
• Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms
• On finding spanning eulerian subgraphs
• Supereulerian graphs: A survey
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Multiplying matrices faster than coppersmith-winograd
• Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
• Parameterized Algorithms
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On Hamiltonian Line-Graphs
• Hamilton cycles and closed trails in iterated line graphs