Hamiltonian index is NP-complete (Q629366): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2010.08.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059973876 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge Hamiltonian path problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Line-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian index of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of even factors in iterated line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamiltonian index of a graph and its branch-bonds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-factor index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian iterated line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5469719 / rank
 
Normal rank

Revision as of 20:00, 3 July 2024

scientific article
Language Label Description Also known as
English
Hamiltonian index is NP-complete
scientific article

    Statements

    Hamiltonian index is NP-complete (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2011
    0 references
    complexity
    0 references
    Hamiltonian index
    0 references
    line graph
    0 references
    branch-bond
    0 references
    NP-complete problem
    0 references

    Identifiers