On computing the Hamiltonian index of graphs
From MaRDI portal
Publication:2699968
DOI10.1016/j.tcs.2022.10.047MaRDI QIDQ2699968
Geevarghese Philip, M. R. Rani, R. Subashini
Publication date: 20 April 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.047
treewidth; fixed-parameter tractability; parameterized complexity; supereulerian graphs; Hamiltonian index; iterated line graphs; spanning Eulerian subgraphs; eulerian Steiner subgraphs
68Qxx: Theory of computing