The Hamiltonian property of consecutive-\(d\) digraphs
From MaRDI portal
Publication:1310230
DOI10.1016/0895-7177(93)90253-UzbMath0789.05040OpenAlexW2034044758MaRDI QIDQ1310230
Frank K. Hwang, D. Frank Hsu, Ding-Zhu Du
Publication date: 12 June 1994
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(93)90253-u
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (19)
An algorithm for identifying cycle-plus-triangles graphs ⋮ Hamiltonian problems in directed graphs with simple row patterns ⋮ The Hamiltonian property of the consecutive-3 digraphs ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks ⋮ Strong coloring 2‐regular graphs: Cycle restrictions and partial colorings ⋮ On finding constrained independent sets in cycles ⋮ Partitioning into common independent sets via relaxing strongly base orderability ⋮ Fair Representation by Independent Sets ⋮ An approach to solving \(A^{k}=J-I\) ⋮ Hamiltonicity of large generalized de Bruijn cycles ⋮ A solution to a colouring problem of P. Erdős ⋮ Connectivity of consecutive-\(d\) digraphs ⋮ EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS ⋮ On endo-Cayley digraphs: the Hamiltonian property ⋮ Miscellaneous Digraph Classes ⋮ On 3-stage Clos networks with different nonblocking requirements on two types of calls ⋮ The complexity of finding fair independent sets in cycles ⋮ Cooperative colorings and independent systems of representatives
Cites Work
This page was built for publication: The Hamiltonian property of consecutive-\(d\) digraphs
