Hamiltonian paths with prescribed edges in hypercubes (Q2370437): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2005.12.045 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024863625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Hamiltonian Circuits in Faulty Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles with Prescribed Edges in Hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of the theory of hypercube graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian circuits and spanning trees of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant Hamiltonian laceability of hypercubes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Combinatorial Gray Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ring embedding in hypercubes with faulty nodes and links / rank
 
Normal rank

Latest revision as of 09:35, 26 June 2024

scientific article
Language Label Description Also known as
English
Hamiltonian paths with prescribed edges in hypercubes
scientific article

    Statements

    Hamiltonian paths with prescribed edges in hypercubes (English)
    0 references
    0 references
    0 references
    26 June 2007
    0 references
    The Caha-Koubek condition states that any proper subset \(S\) of edges of a Hamiltonian path between \(u\) and \(v\) necessarily induces a subgraph \(P\) consisting of pairwise vertex-disjoint paths such that \(P\) contains no path between \(u\) and \(v\), and neither \(u\) nor \(v\) is incident with more than one edge of \(S\). The authors show that given vertices \(u\) and \(v\) with the distance between \(u\) and \(v\) being odd, and a set of at most \(2n-4\) prescribed edges of the \(n\)-dimensional hypercube satisfying the Caha-Koubek condition, there exists a Hamiltonian path between \(u\) and \(v\) passing through every edge of the prescribed set. The results are shown to relate to the classical problem of Hamiltonicity of hypercubes with faulty edges.
    0 references
    Hamiltonian paths
    0 references
    prescribed edges
    0 references
    hypercube
    0 references
    fault tolerance
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references