The Hamiltonian property of the consecutive-3 digraphs
From MaRDI portal
Publication:1368420
DOI10.1016/S0895-7177(97)00086-1zbMATH Open0890.05030MaRDI QIDQ1368420FDOQ1368420
Authors: Li-Da Tong, Gerard Jennhwa Chang, Frank K. Hwang 
Publication date: 25 June 1998
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Recommendations
- The Hamiltonian property of consecutive-\(d\) digraphs
- scientific article; zbMATH DE number 4204369
- The Hamiltonian numbers in digraphs
- On hamiltonicity of circulant digraphs of outdegree three
- Hamiltonian property of 3-connected \([5,3]\)-graphs
- Hamiltonian degree sequences in digraphs
- Hamiltonicity of 3-connected \(L_1\)-graphs
- Hamiltonicity of 3-connected line graphs
- scientific article; zbMATH DE number 3926956
- On the Hamiltonian property hierarchy of 3-connected planar graphs
Cites Work
- A Combinatorial Problem Related to Multimodule Memory Organizations
- Title not available (Why is that?)
- A Design for Directed Graphs with Minimum Diameter
- Design to Minimize Diameter on Building-Block Network
- The Hamiltonian property of generalized de Bruijn digraphs
- Connectivity of circulant digraphs
- Random Number Generators
- Title not available (Why is that?)
- The Hamiltonian property of consecutive-\(d\) digraphs
- The Hamiltonian property of linear functions
Cited In (7)
- Title not available (Why is that?)
- Hamilton cycles in digraphs of unitary matrices
- On hamiltonicity of circulant digraphs of outdegree three
- On connectivity of consecutive-\(d\) digraphs
- The Hamiltonian property of consecutive-\(d\) digraphs
- Hamiltonicity of large generalized de Bruijn cycles
- Eulerian and Hamiltonian dicycles in directed hypergraphs
This page was built for publication: The Hamiltonian property of the consecutive-3 digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1368420)
