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
Cites work
- scientific article; zbMATH DE number 4162913 (Why is no real title available?)
- scientific article; zbMATH DE number 4043882 (Why is no real title available?)
- scientific article; zbMATH DE number 4093495 (Why is no real title available?)
- scientific article; zbMATH DE number 3657692 (Why is no real title available?)
- scientific article; zbMATH DE number 3733966 (Why is no real title available?)
- scientific article; zbMATH DE number 3765833 (Why is no real title available?)
- scientific article; zbMATH DE number 19172 (Why is no real title available?)
- scientific article; zbMATH DE number 3570494 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 867682 (Why is no real title available?)
- scientific article; zbMATH DE number 3353327 (Why is no real title available?)
- A degree sum condition with connectivity for relative length of longest paths and cycles
- A new sufficient condition for hamiltonian graphs
- A note on Hamiltonian circuits
- A remark on Hamiltonian cycles
- Advances on the Hamiltonian problem -- a survey
- Dirac-type generalizations concerning large cycles in graphs
- Graph theory with applications
- Large cycles in 4-connected graphs
- Long cycles in graphs with large degree sums
- Network Flow and Testing Graph Connectivity
- On Maximal Circuits in Finite Graphs
- On maximal paths and circuits of graphs
- Recognizing tough graphs is NP-hard
- Some Theorems on Abstract Graphs
- The longest cycle of a graph with a large minimal degree
- Tough graphs and Hamiltonian circuits.
- Two sufficient conditions for Hamilton and dominating cycles
- Two sufficient conditions for dominating cycles
- Updating the hamiltonian problem—A survey
- Über Hamiltonsche Kreise und unabhängige Ecken in Graphen
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)