A lower bound on the Hamiltonian path completion number of a line graph (Q902504): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.amc.2013.06.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013110476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process selection and sequencing in a two-agents production system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set-up coordination between two stages of a supply chain / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the Hamiltonian completion number of the line graph of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / 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: Q3684150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bi-objective coordination setup problem in a two-stage production system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halin graphs and the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search algorithms for finding the Hamiltonian completion number of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian completions of sparse random graphs / 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: Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for Hamiltonian problems on quasi-threshold graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total interval number of a tree and the Hamiltonian completion number of its line graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on Hamiltonian line graphs involving restrictions on induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximability of the weighted Hamiltonian path completion problem on a tree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:59, 11 July 2024

scientific article
Language Label Description Also known as
English
A lower bound on the Hamiltonian path completion number of a line graph
scientific article

    Statements

    A lower bound on the Hamiltonian path completion number of a line graph (English)
    0 references
    0 references
    0 references
    0 references
    18 January 2016
    0 references
    Hamiltonian path completion number
    0 references
    line graphs
    0 references
    dominating trail
    0 references
    lower bound
    0 references
    0 references
    0 references

    Identifiers