Graph invariants and large cycles: a survey

DOI10.1155/2011/206404zbMath1213.05221OpenAlexW1970942250WikidataQ58687672 ScholiaQ58687672MaRDI QIDQ539347

Zh. G. Nikoghosyan

Publication date: 27 May 2011

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/228120

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Spanning paths and cycles in triangle-free graphs ⋮ The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs

Cites Work

• Large cycles in 4-connected graphs
• Long cycles in graphs with large degree sums
• Recognizing tough graphs is NP-hard
• Dirac-type generalizations concerning large cycles in graphs
• A degree sum condition with connectivity for relative length of longest paths and cycles
• A remark on Hamiltonian cycles
• Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
• Advances on the Hamiltonian problem -- a survey
• Two sufficient conditions for Hamilton and dominating cycles
• A note on Hamiltonian circuits
• Tough graphs and Hamiltonian circuits.
• Two sufficient conditions for dominating cycles
• On maximal paths and circuits of graphs
• The longest cycle of a graph with a large minimal degree
• A new sufficient condition for hamiltonian graphs
• Updating the hamiltonian problem—A survey
• Network Flow and Testing Graph Connectivity
• On Maximal Circuits in Finite Graphs
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph invariants and large cycles: a survey