On Computing the Hamiltonian Index of Graphs

DOI10.1007/978-3-030-50026-9_25MaRDI QIDQ5042256zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• On computing the Hamiltonian index of graphs
• Hamiltonian iterated line graphs
• Hamiltonian index is NP-complete
• scientific article; zbMATH DE number 6500708
• On the Hamiltonian index

Cites work

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

Cited in

(8)

• The Hamiltonian index of a graph and its branch-bonds
• On computing the Hamiltonian index of graphs
• scientific article; zbMATH DE number 6500708 (Why is no real title available?)
• Hamiltonian index is NP-complete
• On testing Hamiltonicity of graphs
• Computing complete graph isomorphisms and Hamiltonian cycles from partial ones
• On the parameterized complexity of the connected flow and many visits TSP problem
• scientific article; zbMATH DE number 3847432 (Why is no real title available?)

This page was built for publication: On Computing the Hamiltonian Index of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5042256)