Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems
From MaRDI portal
Publication:679069
DOI10.1007/BF01165135zbMATH Open0865.92022MaRDI QIDQ679069FDOQ679069
Authors: Pierre Hansen, Maolin Zheng
Publication date: 14 July 1997
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Recommendations
- Advances in graph theory methods of benzenoid systems
- Counting conjugated circuits in benzenoid chains
- HAMILTONian circuits in chordal bipartite graphs
- Hamiltonian circuits in interval graph generalizations
- Hamiltonian circuits and paths in subset graphs with circular adjacency
- Hamiltonian properties of some compound networks
- scientific article; zbMATH DE number 4193714
- scientific article; zbMATH DE number 1890132
- Hamiltonian properties on a class of circulant interconnection networks
- scientific article; zbMATH DE number 4008446
Applications of graph theory (05C90) Paths and cycles (05C38) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Cites Work
- Title not available (Why is that?)
- Graph theory with applications
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Some Theorems on Abstract Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variations on the Hamiltonian Theme
- Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three
This page was built for publication: Hamiltonian circuits, Hamiltonian paths and branching graphs of benzenoid systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q679069)