scientific article; zbMATH DE number 2058271
From MaRDI portal
Publication:4456500
DOI10.3969/J.ISSN.1003-7985.2001.02.019zbMATH Open1041.05045MaRDI QIDQ4456500FDOQ4456500
Publication date: 16 March 2004
Title of this publication is not available (Why is that?)
Recommendations
- A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs
- [[:Publication:4392123|Title not available (Why is that?)]]
- [[:Publication:4030528|Title not available (Why is that?)]]
- [[:Publication:4455286|Title not available (Why is that?)]]
- [[:Publication:4374722|Title not available (Why is that?)]]
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)
Cited In (9)
- A generalization of a result of Häggkvist and Nicoghossian
- Connectivity and Hamiltonian connectedness of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Hamiltonicity in connected regular graphs
- Segment endpoint visibility graphs are Hamiltonian
- Hamiltonian and Lagrangian bond graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4456500)
