Large cycles in graphs
From MaRDI portal
Publication:2548258
DOI10.1016/0012-365X(71)90019-7zbMath0224.05120MaRDI QIDQ2548258
Publication date: 1971
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
A short proof of Fan's theorem, Minimal paths and cycles in set systems, Hamilton cycles in implicit 2-heavy graphs, Minimum implicit degree condition restricted to claws for Hamiltonian cycles, An extremal problem for cycles in hamiltonian graphs, A sufficient condition guaranteeing large cycles in graphs, Hamiltonian cycles in critical graphs with large maximum degree, A sufficient condition for all short cycles, Pancyclic properties of the graph of some 0-1 polyhedra, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture, A note on dominating cycles in 2-connected graphs, An implicit degree sum condition for cycles through specified vertices, Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, Unnamed Item, Hamilton cycles in implicit claw-heavy graphs, 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, Graphs with large maximum degree containing no odd cycles of a given length, Non-Hamiltonian graphs with large minimum degree, On completely positive graphs and their complements, Maximizing the degree powers of graphs with fixed size, Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph, Extremal results for \(C_3^-\)-free signed graphs, Spectral extremal problem on disjoint color-critical graphs, Extremal Numbers for Odd Cycles, Stability of Woodall's theorem and spectral conditions for large cycles, An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian, Large cycles in large labelled graphs, A short proof of a theorem about the circumference of a graph, Old Hamiltonian Ideas from a New Point of View, Revisit of Erdős-Gallai's theorem on the circumference of a graph, Spectral radius and Hamiltonian properties of graphs, II, A strengthening of Erdős-Gallai theorem and proof of Woodall's conjecture, Existence of dominating cycles and paths, An implicit weighted degree condition for heavy cycles, A sufficient condition involving implicit degree and neighborhood intersection for long cycles, Adjacency eigenvalues of graphs without short odd cycles, A spectral condition for odd cycles in non-bipartite graphs, Implicit degree condition for Hamiltonicity of 2-heavy graphs, Unnamed Item, Some eigenvalue properties in graphs (conjectures of Graffiti -- II), All Ramsey numbers for cycles in graphs, On maximal circuits in directed graphs, Generalized and geometric Ramsey numbers for cycles., Toughness in graphs -- a survey, On path connected graphs, Sur les arborescences dans un graphe oriente, A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs, Fan's condition on induced subgraphs for circumference and pancyclicity, On degree sum conditions for long cycles and cycles through specified vertices, A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness, Long cycles and the codiameter of a graph. I, Extensions of the Erdős–Gallai theorem and Luo’s theorem, A new short proof of Fan Theorem, An implicit degree condition for long cycles in 2-connected graphs, Ramsey numbers for cycles in graphs, Stability results on the circumference of a graph, Spectral extrema of graphs: forbidden hexagon, Cycles of even length in graphs, On pancyclic digraphs, Cycles of length 0 modulo 4 in graphs, New sufficient conditions for cycles in graphs, Relations between parameters of a graph, Packing pentagons into complete graphs: How clumsy can you get?, On cycle lengths in graphs of moderate degree
Cites Work
