Graph invariants and large cycles: a survey
DOI10.1155/2011/206404zbMATH Open1213.05221OpenAlexW1970942250WikidataQ58687672 ScholiaQ58687672MaRDI QIDQ539347FDOQ539347
Authors: 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
Recommendations
- Cycles in graphs of fixed girth with large size
- Invariants of connected graphs and vector spaces of cycles and cuts
- scientific article; zbMATH DE number 147652
- Cycles in graphs and related problems
- Dirac-type generalizations concerning large cycles in graphs
- An invariant theory approach to graph enumeration
- INVARIANTS OF GRAPHS
- On bounds for some graph invariants
- scientific article; zbMATH DE number 1539536
- Maximal cycles in graphs of large girth
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)
Cites Work
- Title not available (Why is that?)
- On maximal paths and circuits of graphs
- Graph theory with applications
- Title not available (Why is that?)
- Some Theorems on Abstract Graphs
- A note on Hamiltonian circuits
- Network Flow and Testing Graph Connectivity
- Title not available (Why is that?)
- Tough graphs and Hamiltonian circuits.
- 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 dominating cycles
- A new sufficient condition for hamiltonian graphs
- Title not available (Why is that?)
- Updating the hamiltonian problem—A survey
- On Maximal Circuits in Finite Graphs
- Long cycles in graphs with large degree sums
- Large cycles in 4-connected graphs
- Title not available (Why is that?)
- Recognizing tough graphs is NP-hard
- The longest cycle of a graph with a large minimal degree
- Dirac-type generalizations concerning large cycles in graphs
- Two sufficient conditions for Hamilton and dominating cycles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (5)
- A compilation of relations between graph invariants
- On Infinite Cycles in Graphs: Or How to Make Graph Homology Interesting
- Spanning paths and cycles in triangle-free graphs
- A LARGE COMPLETE GRAPH IN A SPACE CONTAINS A LINK WITH LARGE LINK INVARIANT
- The Hamilton-connectivity with the degree sum of non-adjacent subgraphs of claw-free graphs
This page was built for publication: Graph invariants and large cycles: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q539347)
