scientific article; zbMATH DE number 3215865

Cited in

(44)

Pancyclic graphs and linear forests
Hamiltonian cycles and dominating cycles passing through a linear forest
An implicit degree condition for long cycles in 2-connected graphs
A look at cycles containing specified elements of a graph
Weighted degrees and heavy cycles in weighted graphs
Long cycles in bipartite graphs
Cycles in bipartite graphs
Hamiltonian numbers in oriented graphs
The number of edges, spectral radius and Hamilton-connectedness of graphs
A note on the linear cycle cover conjecture of Gyárfás and Sárközy
Finding long cycles in balanced tripartite graphs: a first step
Ramsey-type results for path covers and path partitions
On the discrepancies of graphs
A stability version for a theorem of Erdős on nonhamiltonian graphs
A variation of a theorem by Pósa
Heavy cycles and spanning trees with few leaves in weighted graphs
Recent advances on the Hamiltonian problem: survey III
Large cycles in graphs
Discrepancies of spanning trees and Hamilton cycles
Vertex covers by monochromatic pieces -- a survey of results and problems
On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity
Stability in the Erdős-Gallai theorems on cycles and paths
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
Neighborhood unions for the existence of disjoint chorded cycles in graphs
Monochromatic loose-cycle partitions in hypergraphs
An implicit weighted degree condition for heavy cycles
Partitioning 2-edge-colored graphs by monochromatic paths and cycles
A note on color-bias Hamilton cycles in dense graphs
Comparison of sufficient degree based conditions for Hamiltonian graph
The binding number of a graph and its Anderson number
Partitioning edge-colored hypergraphs into few monochromatic tight cycles
On a sharp degree sum condition for disjoint chorded cycles in graphs
Oriented discrepancy of Hamilton cycles
The Turán number of Berge hypergraphs with stable properties
Methods for determining cycles of a specific length in undirected graphs with edge weights
Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs
On a property of 2-connected graphs and Dirac's theorem
Chorded edge pancyclicity and chorded vertex pancyclicity with the distance two degree condition
Hamiltonian cycles through a linear forest in bipartite graphs
Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs
The extremal function for two disjoint cycles
Neighborhood unions and disjoint chorded cycles in graphs
New sufficient conditions for cycles in graphs
Disjoint chorded cycles in graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5342985)