Large cycles in graphs
From MaRDI portal
Publication:2548258
Cites work
- Arc coverings of graphs
- scientific article; zbMATH DE number 3455294 (Why is no real title available?)
- scientific article; zbMATH DE number 3215865 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- scientific article; zbMATH DE number 3293646 (Why is no real title available?)
- On a problem of K. Zarankiewicz
- On maximal paths and circuits of graphs
- On the Non-Existence of a Type of Regular Graphs of Girth 5
- Parallel concepts in graph theory
- Sufficient Conditions for Circuits in Graphs†
Cited in
(77)- An implicit degree condition for long cycles in 2-connected graphs
- Existence of dominating cycles and paths
- All Ramsey numbers for cycles in graphs
- On maximal circuits in directed graphs
- On path connected graphs
- Sur les arborescences dans un graphe oriente
- Cycles of length 0 modulo 4 in graphs
- Packing pentagons into complete graphs: How clumsy can you get?
- On cycle lengths in graphs of moderate degree
- A sufficient condition guaranteeing large cycles in graphs
- A sufficient condition for all short cycles
- Graphs with large maximum degree containing no odd cycles of a given length
- On completely positive graphs and their complements
- An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
- Cycles of even length in graphs
- On pancyclic digraphs
- A short proof of Fan's theorem
- An extremal problem for cycles in hamiltonian graphs
- A note on dominating cycles in 2-connected graphs
- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
- A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture
- Adjacency eigenvalues of graphs without short odd cycles
- A spectral condition for odd cycles in non-bipartite graphs
- Minimal paths and cycles in set systems
- An implicit degree sum condition for cycles through specified vertices
- Revisit of Erdős-Gallai's theorem on the circumference of a graph
- Toughness in graphs -- a survey
- Ramsey numbers for cycles in graphs
- Hamilton cycles in implicit 2-heavy graphs
- Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph
- Stability of Woodall's theorem and spectral conditions for large cycles
- A new short proof of fan theorem
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles
- Hamiltonian cycles in critical graphs with large maximum degree
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Hamilton cycles in implicit claw-heavy graphs
- Large cycles in large labelled graphs
- Old Hamiltonian Ideas from a New Point of View
- Fan's condition on induced subgraphs for circumference and pancyclicity
- An implicit weighted degree condition for heavy cycles
- A sufficient condition involving implicit degree and neighborhood intersection for long cycles
- scientific article; zbMATH DE number 1865919 (Why is no real title available?)
- scientific article; zbMATH DE number 7340788 (Why is no real title available?)
- Implicit degree condition for Hamiltonicity of 2-heavy graphs
- Spectral radius and Hamiltonian properties of graphs. II
- Extensions of the Erdős-Gallai theorem and Luo's theorem
- A sufficient condition for edge chromatic critical graphs to be Hamiltonian -- an approach to Vizing's 2-factor conjecture
- Extremal numbers for odd cycles
- Generalized and geometric Ramsey numbers for cycles.
- Pancyclic properties of the graph of some 0-1 polyhedra
- Exact bipartite Turán numbers of large even cycles
- A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs
- Rainbow structures in a collection of graphs with degree conditions
- Edge-maximal θ2k+1-free non-bipartite Hamiltonian graphs of odd order
- Non-Hamiltonian graphs with large minimum degree
- Maximizing the degree powers of graphs with fixed size
- Extremal results for \(C_3^-\)-free signed graphs
- Spectral extremal problem on disjoint color-critical graphs
- Turán problem of signed graph for negative odd cycle
- Implicit degree condition restricted to essential independent sets for Hamiltonian cycles
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Stability in Bondy's theorem on paths and cycles
- Spectral extremal problems for non-bipartite graphs without odd cycles
- The number of edges in graphs with bounded clique number and circumference
- Turán numbers of cycles plus a general graph
- Turán number of books in non-bipartite graphs
- Signless Laplacian index conditions for trebly chorded cycles in graphs with given order
- Transversal Hamilton paths and cycles
- Long cycles and the codiameter of a graph. I
- Stability results on the circumference of a graph
- Spectral extrema of graphs: forbidden hexagon
- New sufficient conditions for cycles in graphs
- Relations between parameters of a graph
- A short proof of a theorem about the circumference of a graph
- On degree sum conditions for long cycles and cycles through specified vertices
This page was built for publication: Large cycles in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2548258)
